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

typedef long long ll;

vector<ll> getBig(string s, int k) {
	vector<ll> ret;
	ret.push_back(atoll(s.substr(0, s.size() - (k - 1)).c_str()));
	for(int i = 0; i < k - 1; i++) {
		ret.push_back(s[s.size() - (k - 1) + i] - '0');
	}
	return ret;
}

vector<ll> getSmall(string s, int k) {
	reverse(s.begin(), s.end());
	vector<ll> ret(k);
	for(int i = 0; i < s.size(); i++) {
		ret[i % k] *= 10;
		ret[i % k] += s[i] - '0';
	}
	return ret;
}

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

	int n, plus = 0, minus = 0;
	string num;
	cin >> n;
	for(int i = 0; i < n; i++) {
		char c;
		cin >> c;
		if(isdigit(c)) num += c;
		else if(c == '+') plus++;
		else minus++;
	}

	sort(num.begin(), num.end(), greater<char>());

	int k = plus + minus + 1;

	ll ans1 = 0;
	vector<ll> v = getBig(num, k);
	int p = 0;
	ans1 += v[0];
	for(int i = 1; i < k; i++) {
		if(p < plus) {
			p++;
			ans1 += v[i];
		}
		else {
			ans1 -= v[i];
		}
	}

	ll ans2 = 0;
	if(minus == 0) {
		v = getSmall(num, k);
		for(int i = 0; i < k; i++) {
			ans2 += v[i];
		}
	}
	else {
		ans2 -= v[0];
		int m = 1;
		for(int i = 1; i < k; i++) {
			if(m < minus) {
				m++;
				ans2 -= v[i];
			}
			else {
				ans2 += v[i];
			}
		}
	}
	cout << ans1 << " " << ans2 << endl;

}