#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <queue>
#include "math.h"
#include <complex>
#include <iomanip>
#include <map>
#include <iostream>
#define ifor(i,a,b) for (int i=(a);i<(b);i++)
#define rfor(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define rep(i,n) for (int i=0;i<(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;
typedef long double ld;
typedef long long int  lli;
typedef complex <double> P;
const double eps = 1e-11;
int vex[4]={1,0,-1,0};
int vey[4]={0,1,0,-1};
typedef vector<double> Vec;
typedef vector<int> vec;
typedef vector<Vec> MAT;
typedef vector<vec> mat;
int number(string &s,int &i){
  int n= s[i++] - '0';
  while(i<s.size()&&isdigit(s[i]))n=n*10+s[i++]-'0';
 // cout<<i<<' ' << n;
  return n;
}
int expr(string &s,int &i){
  int val = number(s,i);
  while(i<s.size()){
    char op = s[i];
    i++;
    if(op=='*')val+=number(s,i);
    else val*=number(s,i);
  }
  return val ;
}
int main(){
  string s;
  cin >> s;
  int i =0;
  cout << expr(s,i)<<endl;
}