#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using tiii = tuple<int,int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const ll DIV =1e9+7;
//const double PI = M_PI;
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
#define chmax(a,b) a=max(a,b)

/*Coding Space*/
string in;
int now = 0;

vector<int> value;
vector<int> ope;
void parse(string in){
  int ret = in[0] - '0';
  rep(i,in.size()-1){
    int tar = i + 1;
    //cerr << in << ' ' << ret << ' ' << ope.size() << ' ' << value.size() << endl;
    if(in[tar] == ' '){
      value.insert(value.begin(),ret);
      return;
    }else if(in[tar] == '+'){
      value.insert(value.begin(),ret);
      ope.insert(ope.begin(),0);
      ret = -1;
      tar++;
    }else if(in[tar] == '*'){
      value.insert(value.begin(),ret);
      ope.insert(ope.begin(),1);
      ret = -1;
      tar++;
    }else{
      if(ret == -1) ret = in[tar] - '0';
      else{
        ret *= 10;
        ret += in[tar] - '0';
      }
    }
  }
  value.insert(value.begin(),ret);
}

int main(){
  cin >> in; in += ' ';
  parse(in);
  reverse(ALL(value));
  reverse(ALL(ope));
  int ans = value[0]; value.erase(value.begin());
  while(ope.size()){
    //cerr << ope.size() << ' ' << value.size() << endl;
    //cerr << ope.top() << ' ' << value.top() << endl;
    if(ope[0])  ans += value[0];
    else ans *= value[0];
    ope.erase(ope.begin());
    value.erase(value.begin());
    //cerr << ans << endl;
  }
  cout << ans << endl;
}