#include <iostream>
#include <fstream>
#include <unordered_map>
#include <cstring>
#include <stack>

#define ll long long
#define pb push_back
using namespace std;
ifstream in("evaluare.in");
ofstream out("evaluare.out");

const int NMax = 1e5 + 5;
const int inf = 1e9 + 5;

int N,nrPost;
int prio[(1<<8) + 10];
char str[NMax];

struct elem {
    int nr;
    char op;
    elem(int _nr = 0,char _op = '\0') {
        nr = _nr;
        op = _op;
    }
}post[NMax];

int main() {
    in>>(str+1);
    str[0] = '(';
    str[N = strlen(str)] = ')';

    prio['('] = 1;
    prio['+'] = prio['-'] = prio[')'] = 2;
    prio['*'] = prio['/'] = 3;

    stack<char> st;
    for (int i=0;i <= N;++i) {
        if (str[i] == '(') {
            st.push('(');
        }
        else if ('0' <= str[i] && str[i] <= '9') {
            int nr = 0;
            while ('0' <= str[i] && str[i] <= '9') {
                nr = nr * 10 + str[i++] - '0';
            }
            --i;

            post[++nrPost] = elem(nr);
        }
        else {
            while (prio[st.top()] >= prio[str[i]]) {
                post[++nrPost] = elem(0,st.top());
                st.pop();
            }

            if (str[i] == ')') {
                st.pop();
            }
            else {
                st.push(str[i]);
            }
        }
    }

    stack<int> aux;
    for (int i=1;i <= nrPost;++i) {
        if (post[i].op == '\0') {
            aux.push(post[i].nr);
        }
        else {
            int nr1 = aux.top(); aux.pop();
            int nr2 = aux.top(); aux.pop();

            int ans;
            switch(post[i].op) {
            case '+': ans = nr2+nr1; break;
            case '-': ans = nr2-nr1; break;
            case '*': ans = nr2*nr1; break;
            case '/': ans = nr2/nr1; break;
            }

            aux.push(ans);
        }
    }

    out<<aux.top();

    in.close();out.close();
    return 0;
}