#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;

int solve(string s) {
    int len = s.size();
    int res = 0;
    int idx = 0;
    char prev = '-';
    while (idx < len) {
	int num = 0;
	while (idx < len && s[idx] != '*' && s[idx] != '+') {
	    num = 10 * num + s[idx] - '0';
	    idx++;
	}
	if (prev == '*') {
	    res += num;
	} else if (prev == '+') {
	    res *= num;
	} else {
	    res = num;
	}
	if (idx < len)
	    prev = s[idx];
	idx++;
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    string s;
    cin >> s;
    cout << solve(s) << endl;
}