#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N;
vector<int>A;
int p,m;
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		char c;cin>>c;
		if(c=='+')p++;
		else if(c=='-')m++;
		else A.push_back(c-'0');
	}
	sort(A.begin(),A.end());
	vector<long>B;
	for(int i=0;i<p+m;i++)B.push_back(A[i]);
	long X=0,T=1;
	for(int i=p+m;i<A.size();i++)
	{
		X+=T*A[i];
		T*=10;
	}
	B.push_back(X);
	long L=0,R=0;
	sort(B.begin(),B.end());
	for(int i=0;i<B.size();i++)
	{
		if(i<m)R-=B[i];
		else R+=B[i];
		if(i+m>=B.size())L-=B[i];
		else L+=B[i];
	}
	if(m==0)
	{
		vector<long>S(p+1,0);
		for(int i=0;i<A.size();i++)
		{
			S[i%S.size()]=S[i%S.size()]*10+A[i];
		}
		L=0;
		for(long s:S)L+=s;
	}
	cout<<R<<" "<<L<<endl;
}