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

using namespace std;
ifstream in("evaluare.in");
ofstream out("evaluare.out");

#define pb push_back
#define ll long long
const int NMax = 1e5 + 5;

int N,nrPost;
int prio[1<<8];
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> ops;
    for (int i=0;i <= N;++i) {
        if (str[i] == '(') {
            ops.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[ops.top()] >= prio[str[i]]) {
                post[++nrPost] = elem(0,ops.top());
                ops.pop();
            }

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

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

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

            stiv.push(res);
        }
    }

    out<<stiv.top()<<'\n';
    in.close();out.close();
    return 0;
}