#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

int conv(string s) {
	int ret = 0;
	int po = 1;
	reverse(all(s));
	rep(i,0,s.size()) {
		ret += (s[i] - '0')*po;
		po *= 10;
	}
	return ret;
}



int main() {
	string s;
	cin >> s;

	int ans = 0;
	string pre = "";
	string temp = "";
	rep(i, 0, s.size()) {
		if (0 <= s[i] - '0' && s[i] - '0' <= 9)temp += s[i];
		else if (s[i] == '*' || s[i] == '+') {
			if (pre == "*" || pre == "")ans += conv(temp);
			else if (pre == "+")ans *= conv(temp);
			pre = s[i];
			temp = "";
		}
	}
	if (pre == "*" || pre == "")ans += conv(temp);
	else ans *= conv(temp);

	cout << ans << endl;


	return 0;
}