#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  string s; cin >> s;
  int x = 0, sum = 0;
  int op = 0;
  rep(i, s.size()) {
    if(isdigit(s[i])) {
      x *= 10; x += s[i]-'0';
    }
    else {
      if(op==0) {
        sum += x;
      }
      else {
        if(sum == 0) sum = 1;
        sum *= x;
      }
      x = 0;
      op = s[i] == '+';
    }
  }
      if(op==0) {
        sum += x;
      }
      else {
        if(sum == 0) sum = 1;
        sum *= x;
      }

      cout << sum << endl;

  return 0;
}