#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;

const string file = "evaluare";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

string sir;
int l;
int p;
int readExpresie();
int readFactor();
int readTermen();


int readExpresie()
{
	int T = readTermen();
	while(p < l && (sir[p] == '+' || sir[p] == '-'))
	{
		if(sir[p] == '+')
		{
			p++;
			T += readTermen();
		}
		else
		{
			p++;
			T -= readTermen();
		}
	}
	return T;
}


int readTermen()
{
	int F = readFactor();
	while(p < l && (sir[p] == '*' || sir[p] == '/'))
	{
		if(sir[p] == '*')
		{
			p++;
			F *= readFactor();
		}
		else
		{
			p++;
			F /= readFactor();
		}
	}
	return F;
}


int readFactor()
{
	if(p < l && sir[p] == '(')
	{
		p++;
		int E = readExpresie();
		p++;
		return E;
	}
	
	int nr = 0;

	while(p < l && '0' <= sir[p] && sir[p] <= '9')
	{
		nr *= 10;
		nr += sir[p] - '0';
		p++;
	}

	return nr;
	
}


int main()
{
	fstream fin(infile.c_str(), ios::in);
	fin >> sir;
	l = sir.length();
	fin.close();

	fstream fout(outfile.c_str(), ios::out);
	fout << readExpresie() << "\n";
	fout.close();
}