#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, M;
string S;
vector<int> v;
int pn = 1, nn = 0;
ll sum[1<<15], dp[1<<15][16];

ll rec(int state, int n){
    if(state == 0 || n == 0){
        return (state == 0 && n == 0) ? 0 : 1001001001001001001ll;
    }
    if(dp[state][n] != 1001001001001001001ll){
        return dp[state][n];
    }

    int x = state;
    while(x > 0){
        ll v = sum[x] + rec(x ^ state, n - 1);
        if(dp[state][n] > v){
            dp[state][n] = v;
        }
        
        x = (x - 1) & state;
    }

    return dp[state][n];
}

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

    std::cin >> N;
    cin.ignore();
    getline(cin, S);

    for(int i=0;i<N;++i){
        if(isdigit(S[i * 2])){
            v.emplace_back(S[i * 2] - '0');
        }else if(S[i * 2] == '+'){
            ++pn;
        }else{
            ++nn;
        }
    }
    
    sort(v.begin(), v.end());

    M = v.size();
    for(int i=0;i<(1<<M);++i){
        ll x = 0;
        for(int j=0;j<M;++j){
            if(i >> j & 1){
                x = x * 10 + v[j];
            }
        }

        sum[i] = x;
    }

    fill(&dp[0][0], &dp[0][0]+(1<<15)*16, 1001001001001001001ll);
    
    ll mx = 0;
    {
        deque<int> deq(v.begin(), v.end());

        for(int i=0;i<nn;++i){
            mx -= deq.front();
            deq.pop_front();
        }

        for(int i=1;i<pn;++i){
            mx += deq.front();
            deq.pop_front();
        }

        ll x = 0;
        while(!deq.empty()){
            x = x * 10 + deq.back();
            deq.pop_back();
        }

        mx += x;
    }

    ll mn = 0;
    if(nn > 0){
        deque<int> deq(v.begin(), v.end());

        for(int i=0;i<pn;++i){
            mn += deq.front();
            deq.pop_front();
        }

        for(int i=1;i<nn;++i){
            mn -= deq.front();
            deq.pop_front();
        }

        ll x = 0;
        while(!deq.empty()){
            x = x * 10 + deq.back();
            deq.pop_back();
        }

        mn -= x;
    }else{
        mn = rec((1 << M) - 1, pn);
    }

    std::cout << mx << " " << mn << std::endl;
}