#include #include #include #include #include #include #include #include #include #include #include #include #include #define REP(i, n) for(decltype(n) i = 0; i < (n); i++) #define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++) #define RREP(i, n) for (decltype(n) i = (n) - 1;i >= 0; i--) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) #define LL long long int #define LD long double #define PI 3.14159265358979 using namespace std; //================================================ int A = 0, ans; bool B = false; void func() { if (B) { ans *= A; } else { ans += A; } A = 0; } int main() { ios::sync_with_stdio(false); cin.tie(0); string S; cin >> S; int Ssize = S.size(); REP(i, Ssize) { if (S[i] == '*') { func(); B = false; } else if (S[i] == '+') { func(); B = true; } else { A *= 10; A += S[i] - '0'; } } func(); cout << ans << "\n"; return 0; }