#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll INF = 1LL << 50;

int n;

ll calc(string s) {
	ll sum = 0;
	bool plus = true;
	int i = 0;
	while(i < n) {
		if(i != 0) {
			plus = s[i] == '+';
			i++;
		}
		int m = 0;
		while(i + m < n && '0' <= s[i + m] && s[i + m] <= '9') m++;

		ll a = 0;
		string ss = s.substr(i, m);
		for(int j = 0; j < m; j++) {
			a += ss[j] - '0';
			if(j != m - 1) a *= 10;
		}
		if(plus) {
			sum += a;
		}
		else {
			sum -= a;
		}
		i += m;
	}
	return sum;
}


bool ok(string s) {
	if(s[0] == '+' || s[0] == '-') return false;
	if(s[n - 1] == '+' || s[n - 1] == '-') return false;
	for(int i = 0; i < n - 1; i++) {
		if((s[i] == '+' || s[i] == '-') && (s[i + 1] == '+' || s[i + 1] == '-'))
			return false;
	}
	return true;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	string s;
	cin >> n;
	for(int i = 0; i < n; i++) {
		char c;
		cin >> c;
		s += c;
	}
	sort(s.begin(), s.end());
	ll ans_max = -INF, ans_min = INF;
	do {
		if(ok(s)) {
			ll m = calc(s);
			ans_max = max(ans_max, m);
			ans_min = min(ans_min, m);
		}
	} while(next_permutation(s.begin(), s.end()));
	cout << ans_max << " " << ans_min << endl;
}