#include <bits/stdc++.h>

using namespace std;

#define MAX (1LL<<55)
#define MIN -(1LL<<55)
typedef long long ll;

int N;
ll dp[1<<15],dp2[1<<15];
char c[15];

ll solve(int,int,ll);
ll solve2(int,int,ll);

ll solve(int idx,int S,ll sum){
    if(idx == N) return sum;
    ll &res = dp[S];
    if(res != MAX) return res;
    for(int i = 0 ; i < N ; i++){
        if(S >> i & 1) continue;
        if(idx == N-1 && (c[i] == '+' || c[i] == '-')){
            return MAX;
        }
        if(sum == -1 && isdigit(c[i])){
            ll nv = c[i]-'0';
            res = min(res,solve(idx+1,S|(1<<i),nv));
        }else if(sum != -1){
            if(isdigit(c[i])){
                ll nv = sum*10LL;
                nv += (ll)(c[i]-'0');
                res = min(res,solve(idx+1,S|(1<<i),nv));
            }else{
                if(c[i] == '+'){
                    res = min(res,sum+solve(idx+1,S|(1<<i),-1));
                }else{
		    ll v = solve2(idx+1,S|(1<<i),-1);
		    if(v != MIN){
			res = min(res,sum-v);
		    }
                }
            }
        }
    }
    return res;
}

ll solve2(int idx,int S,ll sum){
    if(idx == N) return sum;
    ll &res = dp2[S];
    if(res != MIN) return res;
    for(int i = N-1 ; i >= 0 ; i--){
        if(S >> i & 1) continue;
        if(idx == N-1 && (c[i] == '+' || c[i] == '-')){
            return MIN;
        }
        if(sum == -1 && isdigit(c[i])){
            ll nv = c[i]-'0';
            res = max(res,solve2(idx+1,S|(1<<i),nv));
        }else if(sum != -1){
            if(isdigit(c[i])){
                ll nv = sum*10LL;
                nv += c[i]-'0';
                res = max(res,solve2(idx+1,S|(1<<i),nv));
            }else{
                if(c[i] == '+'){
                    res = max(res,sum+solve2(idx+1,S|(1<<i),-1));
                }else{
		    ll v = solve(idx+1,S|(1<<i),-1);
		    if(v != MAX){
			res = max(res,sum-v);
		    }
                }
            }
        }
    }
    return res;   
}

int main(){
    cin >> N;
    for(int i = 0 ; i < N ; i++){
        cin >> c[i];
    }
    sort(c,c+N);
    for(int i = 0 ; i < (1<<N) ; i++){
        dp[i] = MAX;
    }
    for(int i = 0 ; i < (1<<N) ; i++){
        dp2[i] = MIN;
    }
    ll mini = solve(0,0,-1);
    for(int i = 0 ; i < (1<<N) ; i++){
        dp[i] = MAX;
    }
    for(int i = 0 ; i < (1<<N) ; i++){
        dp2[i] = MIN;
    }
    ll maxi = solve2(0,0,-1);
    cout << maxi << " " << mini << endl;
    return 0;
}