#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<complex> #include<bitset> #include<stack> #include<unordered_map> using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = (ll)(1e+9) + 7; const ll INF = (ll)1000000007 * 1000000007; typedef pair<int, int> P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex<ld> Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair<ll, ll> LP; typedef pair<ld, ld> LDP; int main() { string s; cin >> s; int sum = 0; int n = s.length(); vector<int> v; rep(i, n) { if (s[i] == '+' || s[i] == '*')v.push_back(i); } v.push_back(n); sum = stoi(s.substr(0, v[0])); rep(i, (int)v.size()-1) { int len = v[i + 1] - v[i] - 1; int cc = stoi(s.substr(v[i]+1, len)); if (s[v[i]] == '+') { sum *= cc; } else { sum += cc; } } cout << sum << endl; // stop return 0; }