#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
using namespace std;

int main(){
	string s;
	string a;
	cin >> s;
	int i = 0;
	int flag = 0;
	int ans = 0;
	int tasu;
	int kakeru;
	while (1){
		a = s;
		tasu = a.find("*", i);
		kakeru = a.find("+", i);
		//cout << a << endl;
		if (tasu != -1 && kakeru != -1){
			if (tasu < kakeru){
				a.erase(tasu, a.length());
				if (flag == 0){
					ans += stoi(a);
				}
				else{
					ans *= stoi(a);
				}
				flag = 0;
				//i = tasu;
				s.erase(0, tasu+1);
			}
			else{
				a.erase(kakeru, a.length());
				if (flag == 0){
					ans += stoi(a);
				}
				else{
					ans *= stoi(a);
				}
				flag = 1;
				//i = kakeru;
				s.erase(0, kakeru+1);
			}
		}
		else if (tasu == -1 && kakeru != -1){
			a.erase(kakeru, a.length());
			if (flag == 0){
				ans += stoi(a);
			}
			else{
				ans *= stoi(a);
			}
			flag = 1;
			//i = kakeru;
			s.erase(0, kakeru + 1);
		}
		else if (tasu != -1 && kakeru == -1){
			a.erase(tasu, a.length());
			if (flag == 0){
				ans += stoi(a);
			}
			else{
				ans *= stoi(a);
			}
			flag = 0;
			//i = tasu;
			s.erase(0, tasu + 1);
		}
		else{
			
			if (flag == 0){
				ans += stoi(a);
			}
			else{
				ans *= stoi(a);
			}
			break;
		}
	}
	cout << ans << endl;
	return 0;
}