#include <cstdio>
#include <vector>

using namespace std;

typedef long long LL;
typedef vector<int> vi;
typedef vector< vi > vii;
typedef vector<string> vs;
typedef vector<double> vd;
typedef pair<int, int> ii;
#define PB push_back
#define SZ(v) v.size()
#define ALL(v) (v).begin(), (v).end()
#define FORIT(i,c) for (typeof((c).end()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i,n) for (int i = 0; i<(n); ++i)
#define FORE(i,n) for (int i = 0; i<=(n); ++i)
#define FORI(i,n1,n2) for (int i = n1; i<(n2); ++i)
#define FORIE(i,n1,n2) for (int i = n1; i<=(n2); ++i)
#define FORV(i,v) for (unsigned int i = 0; i<SZ(v); ++i)

#define INF 0x3f3f3f3f
#define EPS 1e-9

#define NMAX 100000

char A[NMAX];
int N;
int k;

int termen();
int factor();

int eval()
{
    int r = termen();
    while (A[k] == '+' || A[k] == '-')
    {
        switch (A[k])
        {
            case '+':
                ++k;
                r += termen();
            break;

            case '-':
                ++k;
                r -= termen();
            break;
        }
    }
    return r;
}

int termen()
{
    int r = factor();
    while (A[k] == '*' || A[k] == '/')
    {
        switch (A[k])
        {
            case '*':
                ++k;
                r *= termen();
            break;

            case '/':
                ++k;
                r /= termen();
            break;
        }
    }
    return r;
}

int factor()
{
    int r = 0;
    if (A[k] == '(')
    {
        ++k;
        r = eval();
        ++k;
    }
    else
    {
        while (A[k] >= '0' && A[k] <= '9')
        {
            r = r*10 + A[k]-'0';
            ++k;
        }

    }
    return r;
}

int main()
{
    freopen("evaluare.in", "r", stdin);
    freopen("evaluare.out", "w", stdout);

    gets(A);
    N = strlen(A);

    printf("%d\n", eval());

    return 0;
}