#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>

static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;


int num(string &s, int &cur){
    int ans = s[cur++] - '0';
    while(isdigit(s[cur])) ans = ans*10+(s[cur++]-'0');
    return ans;
}

int expr(string &s, int &cur){
    int ans = num(s, cur);
    while(true){
        if(s[cur] == '+'){
            cur++;
            ans *= num(s, cur);
        }else if(s[cur] == '*'){
            cur++;
            ans += num(s, cur);
        }else break;
    }
    return ans;
}

int main() {
    string s;
    cin >> s;
    int c = 0;
    cout << expr(s, c) << "\n";
    return 0;
}