#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <numeric>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
#include <cassert>
#include <random>
#include <time.h>
#include <unordered_set>
//#include <boost/multiprecision/cpp_int.hpp>



using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const double EPS = 1e-10;
long long const MOD = 998244353;

long long mod_pow(long long x, long long n) {
    long long res = 1;
    for (int i = 0;i < 60; i++) {
        if (n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}

template<typename T>
T gcd(T a, T b) {
    return b != 0 ? gcd(b, a % b) : a;
}

template<typename T>
T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

void fastInput() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}


string S;
int idx = 0;
int eval_num(void) {
    int ret = 0;
    while (idx < S.length() && '0' <= S[idx] && S[idx] <= '9') {
        ret *= 10;
        ret += S[idx] - '0';  
        idx++;
    }
    return ret;
}

int eval(void) {
    int ret = eval_num();
    
    while (idx < S.length()) {
        if (S[idx] == '*') {
            idx++;
            ret += eval_num();
        } else {
            idx++;
            ret *= eval_num();
        }
    }
    return ret;
}

int main(void) {
    cin >> S;
    cout << eval() << endl;
}