#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(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--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

signed main()
{
    string s;
    cin >> s;
    int ret = 0;
    string tmp = "";
    char op = ' ';
    REP(i,s.size()) {
        char c = s[i];
        if (c == '+' || c == '*') {
            if (op == ' ') {
                ret = atoll(tmp.c_str());
            } else if (op == '+') {
                ret *= atoll(tmp.c_str());
            } else if (op == '*') {
                ret += atoll(tmp.c_str());
            }
            op = c;
            tmp = "";
        } else {
            tmp += c;
        }
    }
    if (op == '+') {
        ret *= atoll(tmp.c_str());
    } else if (op == '*') {
        ret += atoll(tmp.c_str());
    }
    cout << ret << endl;

    return 0;
}