#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int(i)=0;(i)<(n);++(i))
#define in(T,V) T V;cin>>V;

ll get(string &s, int n){
    if(n < 0 || n > s.size()) n = s.size();
    string r = s.substr(0,n);
    s.erase(s.begin(), s.begin()+n);
    return strtoll(r.c_str(),NULL, 10);
}

ll solvemax(int N, string nu, int pl, int mi){
    int maxdgt = nu.length() - (pl + mi);
    sort(nu.rbegin(), nu.rend());
    ll res = get(nu, maxdgt);
    REP(i,pl) res += get(nu,1);
    REP(i,mi) res -= get(nu,1);
    return res;
}

ll solvemin(int N, string nu, int pl, int mi){
    sort(nu.begin(), nu.end());
    ll res = 0;
    if(mi > 0){
        REP(i,pl+1) res += get(nu,1);
        REP(i,mi-1) res -= get(nu,1);
        sort(nu.rbegin(), nu.rend());
        res -= get(nu,-1);
    } else {
        ll s[15]; REP(i,15) s[i] = 0;
        int len = nu.length();
        REP(i,len){
            auto &v = s[i % (pl+1)];
            v = v * 10 + (nu[i]-'0');
        }
        REP(i,pl+1) res += s[i];
    }
    return res;
}

int main(){
    int N,pl=0,mi=0;
    string nu;
    cin >> N;
    REP(i,N){
        in(string, s);
        switch(s[0]){
        case '+': pl++; break;
        case '-': mi++; break;
        default: nu += s; break;
        }
    }

    cout << solvemax(N,nu,pl,mi) << " " << solvemin(N,nu,pl,mi) << endl;
}