#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
string S;
/*==================================================*/
/*function*/

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

int main() {
    cin>>S;
    int num = 0;
    int d = 10;
    int t = 0;
    int op = 0;

    REP(i,0,S.size()){
        if(isdigit(S[i])){
            num = num*d + (S[i] - '0');
        }else{
            if(op == 0) t += num;
            else t *= num;

            if(S[i] == '*') op = 0;
            else op = 1;

            num = 0;
        }
    }
    if(op == 0) t += num;
    else t *= num;

    cout<<t<<endl;
    return 0;
}