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

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

#define ll long long
#define pb push_back
const int NMax = 1e5 + 5;
const int lvlMax = 2;
const char lvlOp[2][3] = {"+-","*/"};

char str[NMax],*p = str;

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

arbNode *eval(int);
int compute(arbNode*);

int main() {
    in>>str;
    arbNode *root = eval(0);
    out<<compute(root)<<'\n';

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

arbNode *eval(int lvl) {
    arbNode *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 arbNode(nr);
        }
    }
    else {
        for (ans = eval(lvl+1); *p != '\0' && strchr(lvlOp[lvl],*p);) {
            char op = *p++;
            ans = new arbNode(0,op,ans,eval(lvl+1));
        }
    }
    return ans;
}

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