#include <iostream>
#include <fstream>
#include <cstring>

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

typedef long long ll;
const int NMax = 1e5 + 5;
const int lvlMax = 2;
const char lvlOp[2][3] = {'+','-','\0','*','/','\n'};

int N;
char str[NMax],*p;

struct nod {
    int nr;
    char op;
    nod *st,*dr;
    nod (int _nr = 0,char _op ='\0',nod *_st = nullptr,nod *_dr = nullptr) {
        nr = _nr;
        op = _op;
        st = _st;
        dr = _dr;
    }
};

nod *eval(int);
int compute(nod*);

int main() {
    in>>str;
    str[strlen(str)] = 'f';

    //cout<<str<<'\n';

    p = str;
    nod *root = eval(0);

    out<<compute(root)<<'\n';

    return 0;
}

nod *eval(int lvl) {
    nod *ans = 0;
    if (lvl == lvlMax) {
        if (*p == '(') {
            ++p;
            ans = eval(0);
            ++p;
        }
        else {
            int nr = 0;
            while ('0' <= *p && *p <= '9') {
                nr = nr * 10 + (*p++ - '0');
            }
            ans = new nod(nr);
        }
    }
    else {
        for (ans = eval(lvl+1); strchr(lvlOp[lvl],*p); ) {
            char op = *p++;
            //ans = compute(ans,eval(lvl+1),op);
            ans = new nod(0,op,ans,eval(lvl+1));
        }
    }

    return ans;
}

int compute(nod* n) {
    switch (n -> op) {
    case '+': return compute(n -> st) + compute(n -> dr);
    case '-': return compute(n -> st) - compute(n -> dr);
    case '*': return compute(n -> st) * compute(n -> dr);
    case '/': return compute(n -> st) / compute(n -> dr);
    default: return n -> nr;
    }
}