#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

using S = string::iterator;

ll num(S& it) {
    ll res = 0;
    while (*it >= '0' && *it <= '9') {
        res *= 10;
        res += *it - '0';
        ++it;
    }
    return res;
}
ll exp(S& it) {
    ll cur = num(it);
    if (*it == '*') cur += exp(++it);
    else if (*it == '+') cur *= exp(++it);
    return cur;
}

void solve() {
    string s;
    cin >> s;
    auto it = s.begin();
    ll ans = num(it);
    while (it != s.end()) {
        if (*it == '*') ans += num(++it);
        else if (*it == '+') ans *= num(++it);
    }

    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}