#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    string s;
    s.resize(N);
    vector<int> vs;
    int minuscnt = 0, pluscnt = 0;
    for (int i = 0; i < N; i++) {
        cin >> s[i];
        if (s[i] == '+') pluscnt++;
        else if (s[i] == '-') minuscnt++;
        else vs.push_back(s[i]-'0');
    }
    sort(vs.begin(), vs.end());
    reverse(vs.begin(), vs.end());
    int maxi = 0;
    int cnt = vs.size()-pluscnt-minuscnt;
    for (int i = 0; i < cnt; i++) {
        maxi = maxi*10+vs[i];
    }
    {
        int ans = maxi;
        for (int i = 0; i < pluscnt; i++) {
            ans += vs[i+cnt];
        }
        for (int i = 0; i < minuscnt; i++) {
            ans -= vs[i+cnt+pluscnt+i];
        }
        cout << ans << " ";
    }
    {
        if (minuscnt) {
            int ans = -maxi;
            for (int i = 0; i < minuscnt-1; i++) {
                ans -= vs[i+cnt];
            }
            for (int i = 0; i < pluscnt+1; i++) {
                ans += vs[i+cnt+minuscnt-1];
            }
            cout << ans << endl;
        } else {
            int num = (pluscnt+1)/(N-pluscnt-minuscnt);
            int pnum = num+1;
            int p = (pluscnt+1)%(N-pluscnt-minuscnt);
            int ans = 0;
            int cur = 0;
            for (int i = 0; i < p; i++) {
                int tmp = 0;
                for (int j = 0; j < pnum; j++) {
                    tmp = tmp*10+vs[cur++];
                }
                ans += tmp;
            }
            for (int i = 0; i < pluscnt+1-p; i++) {
                int tmp = 0;
                for (int j = 0; j < num; j++) {
                    tmp = tmp*10+vs[cur++];
                }
                ans += tmp;
            }
            cout << ans << endl;
        }
    }
    return 0;
}