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

#define FOR(a,b,c) for(int a=b;a<=c;a++) 
#define SIZEOF(a) (sizeof(a)/sizeof(a[0]))
#define FORARR(i,a) for(unsigned i=0; i<SIZEOF(a);i++)
#define FOREACH(a,b) for(_typeof((b).begin()) a=(b).begin(); a!=(b).end();a++)
#define GETI(a) scanf("%d", &a)

using namespace std;

#define ULL unsigned long long

int nums[100];
char ops[100];

bool computed_min[101][101];
ULL value_min[101][101];
bool computed_max[101][101];
ULL value_max[101][101];


// spocita minimalni hodnotu podvyrazu od pozice offset delky len
ULL minimum(int offset, int len)
{
	if (len == 1) {
		return nums[offset];
	}
	
	if (computed_min[offset][len]) {
		return value_min[offset][len];
	}
	
	
	
	ULL mn = (ops[offset] == '+' ?
		minimum(offset, 1) + minimum(offset+1, len-1) :
		minimum(offset, 1) * minimum(offset+1, len-1)
		);
	
	FOR(i,2,len-1) {
		if (ops[offset+i-1] == '+') {
			mn = min(mn, minimum(offset, i) + minimum(offset+i, len-i));
		}
		else {
			mn = min(mn, minimum(offset, i) * minimum(offset+i, len-i));
		}
	}
	value_min[offset][len] = mn;
	computed_min[offset][len] = true;
	return mn;
}


// spocita maximalni hodnotu podvyrazu od pozice offset delky len
ULL maximum(int offset, int len)
{
	if (len == 1) {
		return nums[offset];
	}
	
	if (computed_max[offset][len]) {
		return value_max[offset][len];
	}
	
	
	
	ULL mx = (ops[offset] == '+' ?
		maximum(offset, 1) + maximum(offset+1, len-1) :
		maximum(offset, 1) * maximum(offset+1, len-1)
		);
	
	FOR(i,2,len-1) {
		if (ops[offset+i-1] == '+') {
			mx = max(mx, maximum(offset, i) + maximum(offset+i, len-i));
		}
		else {
			mx = max(mx, maximum(offset, i) * maximum(offset+i, len-i));
		}
	}
	value_max[offset][len] = mx;
	computed_max[offset][len] = true;
	return mx;
}


int main(void)
{
	int first;
	while (GETI(first) == 1) {
		int nums_cnt = 1;
		
		nums[0] = first;
		
		while (true) {
			scanf("%c", &ops[nums_cnt-1]);
			if (ops[nums_cnt-1] == '\n') break;
			GETI(nums[nums_cnt]);
			nums_cnt++;
		}
		
		FOR(i,0,100) {
			FOR(j,0,100) {
				computed_min[i][j] = false;
				computed_max[i][j] = false;
			}
		}
		
		
		cout << minimum(0, nums_cnt) << " " << maximum(0, nums_cnt) << endl;
		
		
		
		
		/*
		
		// pocitame minimum vyrazu
		ULL mn[101][101];
		// prvni index: delka vyrazu
		// druhy index: offset = delka prvni zavorky
		mn[1][1] = nums[0];
		FOR(exprLen, 2, nums_cnt) {
			char op = ops[exprLen-1];
			int operand = nums[exprLen];
			
			ULL emin = (op == '+' ? mn[exprLen-1][1] + operand : mn[exprLen-1][1] * operand);
			FOR(offset, 1, offset-1) {
				emin = min(emin, );
			}
		}
		
		*/
	}


	return 0;
}