#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#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 <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

string S;
int i = 0;

int fact() {
	int v = 0;
	while (S[i] >= '0' && S[i] <= '9') {
		v *= 10;
		v += S[i] - '0';
		++i;
	}
	return v;
}

int solve() {
	int v = fact();
	while (true) {
		if (S[i] == '*') {
			++i;
			v += fact();
		}
		else if (S[i] == '+') {
			++i;
			v *= fact();
		}
		else {
			break;
		}
	}
	return v;
}

int main(int argc, char **argv) {
	cin >> S;
	S += ";";
	cout << solve() << endl;
	return 0;
}