#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()


lint ipow(lint x, lint n)
{
	lint i, ret = 1;
	for (i = 0; i < n; i++)
		ret *= x;
	return ret;
}

int yuki0297()
{
	// - のカードがあるかないかで異なる
	int N;
	cin >> N;

	int plus = 0, minus = 0;
	vector<int> v;

	char ch;
	REP(i, N) {
		cin >> ch;
		if (isdigit(ch)) v.push_back((int)(ch - '0'));
		else if (ch == '+') plus++;
		else if (ch == '-') minus++;
	}
	
	sort(all(v), greater<lint>());
	// 作れる最もでかい数字
	lint g = 0;
	for (int i = 0; i < v.size() - plus - minus; i++) {
		g *= 10;
		g += v[i];
	}

	lint m, M;

	// 最大
	M = g;
	for (int i = v.size() - plus - minus; i < v.size() - minus; i++) M += v[i];
	for (int i = v.size() - minus; i < v.size(); i++) M -= v[i];

	// 最小
	if (minus == 0) {
		m = 0;
		int q, r;
		q = v.size() / (plus + 1);
		r = v.size() % (plus + 1);
		int e = 0;
		for (e = 0; e < q; e++) {
			lint sum = accumulate(v.begin() + e * (plus + 1), v.begin() + (e + 1) * (plus + 1), 0);
			m += sum * ipow(10, e);
		}
		m += accumulate(v.begin() + e * (plus + 1), v.end(), 0) * ipow(10, e);
	}
	else {
		sort(all(v));
		m = v[0];
		for (int i = 1; i <= plus; i++) m += v[i];
		for (int i = plus + 1; i < plus + minus; i++) m -= v[i];
		m -= g;
	}
	
	cout << M << " " << m << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0297();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}