#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

set<string> s;

int main()
{
	string s,str="";  cin >> s;

	ll num = 0,ans=0;
	char ope = '*';
	for (int i = 0; i < s.size(); i++) {
		if (s[i] >= '0' && s[i] <= '9') {
			str += s[i];
		}
		if (s[i] < '0' || s[i] > '9' || (i == s.size() - 1)) {
			if (ope == '+') {
				ans = ans * stoll(str);
			}
			else if (ope == '*') {
				ans = ans + stoll(str);
			}
			ope = s[i];
			num = stoll(str);
			str = "";
		}
	}
	cout << ans << endl;
	return	0;
}