import java.util.*;

class Main {
    //棧nums 存運(yùn)算數(shù)
    private static Deque<Integer> nums = new ArrayDeque<>();
    //棧ops 存運(yùn)算符
    private static Deque<Character> ops = new ArrayDeque<>();
    
    //哈希表用來映射運(yùn)算符優(yōu)先級
    private static HashMap<Character, Integer> hash = new HashMap<>();
    
    //初始化哈希表
    static {
        hash.put('+', 1);
        hash.put('-', 1);
        hash.put('*', 2);
        hash.put('/', 2);
    }
    
    //判斷某個(gè)字符是否是數(shù)字
    private static boolean isDigit(char c) {
        return c >= '0' &&c <= '9';
    }
    
    //實(shí)現(xiàn)運(yùn)算方法
    private static void eval() {
        //去除第二個(gè)運(yùn)算數(shù)
        int b = nums.pollLast();
        //取出第一個(gè)運(yùn)算數(shù)
        int a = nums.pollLast();
        //取出運(yùn)算符
        char op = ops.pollLast();
        
        //判斷符號，對應(yīng)進(jìn)行運(yùn)算
        if (op == '+') nums.offerLast(a + b);
        else if (op == '-') nums.offerLast(a - b);
        else if (op == '*') nums.offerLast(a * b);
        else if (op == '/') nums.offerLast(a / b);
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        String s = sc.nextLine();
        
        char[] cs = s.toCharArray();
        
        for (int i = 0; i < cs.length; i++) {
            char c = cs[i];
            
            if (isDigit(c)) {
                //遍歷的字符為數(shù)字，取出完整的數(shù)字放在數(shù)組當(dāng)中
                int ret = c - '0';
                int j = i + 1;
                while (j < cs.length && isDigit(cs[j])) {
                    ret = ret * 10 + (cs[j] - '0');
                    j++;
                }
                //更新i
                i = j - 1;
                //將數(shù)字入棧
                nums.offerLast(ret);
            } else if (c == '(') {
                //遇到(，直接入棧ops
                ops.offerLast(c);
            } else if (c == ')') {
                //遇到)，進(jìn)行運(yùn)算操作，直到棧頂遇到(為止
                while (!ops.isEmpty() && ops.peekLast() != '(') eval();
                //遇到(，將(出棧
                ops.pollLast();
            } else {
                //遇到運(yùn)算符，則比較優(yōu)先級，如棧頂運(yùn)算符優(yōu)先級大，則進(jìn)行運(yùn)算，直到棧為空或棧頂運(yùn)算符較小或棧頂運(yùn)算符為(
                while (!ops.isEmpty() && ops.peekLast() != '(' && hash.get(ops.peekLast()).compareTo(hash.get(c)) >= 0) eval();
                
                //將當(dāng)前運(yùn)算符入棧
                ops.offerLast(c);
            }
        }
        
        //檢查ops棧內(nèi)是否還有運(yùn)算符，如果還有，則表示運(yùn)算還沒結(jié)束，繼續(xù)運(yùn)算，直到ops棧無運(yùn)算符為止
        while (!ops.isEmpty()) eval();
        
        //輸出nums棧頂元素，即是最終運(yùn)算結(jié)果
        System.out.println(nums.peekLast());
    }
}

include <iostream>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <string>

using namespace std;

//棧1 存儲(chǔ)元素
stack<int> nums;
//棧2 存儲(chǔ)操作符號
stack<char> ops;


//哈希表 用來存儲(chǔ)運(yùn)算符優(yōu)先級
unordered_map<char, int> pri = {{'+', 1}, {'-', 1}, {'*', 2}, {'/', 2}};

void eval()
{
    //取第二個(gè)操作數(shù)
    int b = nums.top();
    nums.pop();
    //取第一個(gè)操作數(shù)
    int a = nums.top();
    nums.pop();
    
    //取操作符
    char op = ops.top();
    ops.pop();
    
    //進(jìn)行運(yùn)算
    if (op == '+') nums.push(a + b);
    else if (op == '-') nums.push(a - b);
    else if (op == '*') nums.push(a * b);
    else if (op == '/') nums.push(a / b);
    
    //cout << a << " " << op << " " << b << "=";
    
    //cout << nums.top() << endl;
}

int main()
{
    string s;
    cin >> s;
    
    for (int i = 0; i < s.size(); i++) 
    {
        char c = s[i];
        if (isdigit(c)) 
        {
            //字符為數(shù)字，將該數(shù)字放入到儲(chǔ)存數(shù)字的棧中
            int j = i + 1;
            int ret = s[i] - '0';
            while (j < s.size() && isdigit(s[j]))
            {
                ret = ret * 10 + (s[j] - '0');
                j++;
            }
            //更新i
            i = j  - 1;
            nums.push(ret);
        } else if (c == '(') 
        {
            ops.push(c);
        } else if (c == ')') 
        {
            //遇到右括號對棧元素進(jìn)行運(yùn)算，直到遇到(為止
            while (ops.size() > 0 && ops.top() != '(') eval();
            ops.pop();
        } else {
            //遇到運(yùn)算符，比較優(yōu)先級，如果優(yōu)先級較高，則進(jìn)行運(yùn)算
            while (ops.size() > 0 && ops.top() != '(' && pri[ops.top()] >= pri[c]) eval();
            ops.push(c);
        }
    }
    
    //如果還有剩余運(yùn)算符 則繼續(xù)運(yùn)算
    while (ops.size() > 0) eval();
    //棧頂元素即為最終的運(yùn)算結(jié)果
    cout << nums.top() << endl;
    return 0;
}