#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <cctype>

using namespace std;

typedef unsigned long long L;

L dp[111][111];
L DP[111][111];
string s;
int ind;
string o;

int getnum()
{
    int r = 0;
    while(ind < s.size() && isdigit(s[ind]))
            r = r*10 + s[ind++]-'0';
    return r;
}

L op(L a, L b, char op)
{
    if(op == '*')
        return a*b;
    else
        return a+b;
}

int main()
{
    while(getline(cin,s) && s != "END") {
        vector<L> v;
        ind = 0;

        while(1) {
            v.push_back(getnum());
            if(ind >= s.size())
                break;
            o.push_back(s[ind++]);
        }

        int n = v.size(); 
        for(int i = 0; i < v.size(); ++i) {
            dp[i][0] = v[i];
            DP[i][0] = v[i];
        }

        for(int i=1; i < n; ++i) {
            for(int j=0; j<n-i; ++j) {
                L m = 1ull<<63;
                L M = 0;
                for(int k = 0; k < i; ++k) {
                    L t = op(dp[j][k], dp[j+k+1][i-k-1], o[j+k]);
                    if(t < m)
                        m = t;
                    t = op(DP[j][k], DP[j+k+1][i-k-1], o[j+k]);
                    if(t > M)
                        M = t;
                }

                dp[j][i] = m;
                DP[j][i] = M;
            }
        }

        cout << dp[0][n-1] << ' ' << DP[0][n-1] << endl;
    }

    return 0;
}