#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

vector<pair<long long, long long>> prime_factorize(long long N){
    vector<pair<long long, long long>> res;
    for(long long a = 2; a * a <= N; ++a){
        if(N % a != 0) continue;
        long long ex = 0;
        while(N % a == 0) ++ex, N /= a;
        res.push_back({a,ex});
    }
    if(N != 1) res.push_back({N,1});
    return res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    string S; cin >> S;
    ll ans = 0;
    char c = '?';
    ll num = 0;
    int n = S.size();
    for(int i = 0; i < n; i++) {
        if(isdigit(S[i])) {
            num = num * 10 + S[i] - '0';
            if(i == n - 1 || i + 1 < n && !isdigit(S[i + 1])) {
                if(c == '+')
                    ans = ans * num;
                else
                    ans = ans + num;
                num = 0;
            }
        } else {
            c = S[i];
        }
    }

    cout << ans << endl;
}