#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <climits>
#include <cassert>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX/3
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define ALL(v) (v).begin(),(v).end()

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

void func(int& ans,int& n,char op){
    if(op=='+') ans = ans * n;
    else ans = ans + n;
}

int main(){
    string s; cin>>s;
    int ans = 0;
    int t = 0;
    char op = '*';
    for(int i=0;i<s.size();i++){
        if('0'<=s[i] and s[i]<='9'){
            t = t * 10 + s[i]-'0';
        }
        else if(s[i]=='*'){
            func(ans,t,op);
            op = '*';
            t=0;
        }
        else if(s[i]=='+'){
            func(ans,t,op);
            op = '+';
            t=0;
        }
    }
    func(ans,t,op);
    cout << ans << endl;
}