#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double
int ceildiv(int one, int two) {
	if (one % two == 0) {return one / two;}
	else {return one / two + 1;}
} int power(int n, int pow, int m) {
	if (pow == 0) return 1;
	if (pow % 2 == 0) {
		ll x = power(n, pow / 2, m);
		return (x * x) % m;
	}
	else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
	if (!b)return a;
	return gcd(b, a % b);
} int factorial(int n, int mod) {
	if (n > 1)
		return (n * factorial(n - 1, mod)) % mod;
	else
		return 1;
} int lcm(int a, int b) {
	return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}vector<vector<int>> adj;void init(int n) {for (int i = 0; i <= n; i++) { vector<int> a; adj.pb(a);}}
 
bool delim(char c) {
	return c == ' ';
}

bool is_op(char c) {
	return c == '+' || c == '-' || c == '*' || c == '/';
}

int priority (char op) {
	if (op == '+' || op == '-')
		return 1;
	if (op == '*' || op == '/')
		return 2;
	return -1;
}

void process_op(stack<int>& st, char op) {
	int r = st.top(); st.pop();
	int l = st.top(); st.pop();
	switch (op) {
		case '+': st.push(l + r); break;
		case '-': st.push(l - r); break;
		case '*': st.push(l * r); break;
		case '/': st.push(l / r); break;
	}
}

int evaluate(string& s) {
	stack<int> st;
	stack<char> op;
	for (int i = 0; i < (int)s.size(); i++) {
		if (delim(s[i]))
			continue;
		
		if (s[i] == '(') {
			op.push('(');
		} else if (s[i] == ')') {
			while (op.top() != '(') {
				process_op(st, op.top());
				op.pop();
			}
			op.pop();
		} else if (is_op(s[i])) {
			char cur_op = s[i];
			while (!op.empty() && priority(op.top()) >= priority(cur_op)) {
				process_op(st, op.top());
				op.pop();
			}
			op.push(cur_op);
		} else {
			int number = 0;
			while (i < (int)s.size() && isalnum(s[i]))
				number = number * 10 + s[i++] - '0';
			--i;
			st.push(number);
		}
	}
	
	while (!op.empty()) {
		process_op(st, op.top());
		op.pop();
	}
	return st.top();
}
 
int32_t main() {
	startt;
	freopen("evaluare.in", "r", stdin);
	freopen("evaluare.out", "w", stdout);
	string s;
	cin >> s;
	cout << evaluate(s) << endl;
}