#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  string str;
  cin >> str;

  int ret = 0;
  int p = 0;
  vector<int> a, b;
  rep(i,str.length()){
    if(str[i]=='*' || str[i]=='+'){
      a.push_back(p);
      p = 0;
      if(str[i]=='*'){
        b.push_back(1);
      }
      if(str[i]=='+'){
        b.push_back(2);
      }
    }else{
      p = 10*p + (str[i]-'0');
      if(i==str.length()-1){
        a.push_back(p);
      }
    }
  }

  ret = a[0];
  rep(i,b.size()){
    if(b[i]==1){
      ret += a[i+1];
    }
    if(b[i]==2){
      ret *= a[i+1];
    }
  }

  cout << ret << endl;
  
  return 0;
}