#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int ans;
string s;
int main(){
    cin>>s;
    int tmp=0;
    bool plus=true;
    REP(i,0,s.size()){
        if(isdigit(s[i])) {
            tmp*=10;
            tmp+=s[i]-'0';
        }else{
            if(plus){
                ans+=tmp;
            }else{
                ans*=tmp;
            }
            tmp=0;
            if(s[i]=='+'){
                plus=false;
            }else{
                plus=true;
            }

        }
    }
    if(plus){
        ans+=tmp;
    }else{
        ans*=tmp;
    }
    p(ans);

    return 0;
}