#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define ALL(c) begin(c), end(c)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;


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

    int N;
    cin >> N;
    vector<int> n;
    int plus = 0, minus = 0;
    FOR(i, N) {
        char c;
        cin >> c;
        if (c == '+') plus++;
        else if (c == '-') minus++;
        else {
            n.push_back(c - '0');
        }
    }
    sort(ALL(n));

    ll amax = 0, amin = n[0];
    FOR(i, plus) {
        amax += n[minus+i];
        amin += n[i+1];
    }
    FOR(i, minus) {
        amax -= n[i];
        if (i) amin -= n[plus+i];
    }
    ll nx = 0, d = 1;
    FORR(i, plus+minus, n.size()) {
        nx += n[i] * d;
        d *= 10;
    }
    amax += nx;
    amin -= nx;

    if (minus == 0) {
        int k = plus+1, d = 1;
        while (k < n.size()) {
            for (int i = 0; i < plus+1 && k + i < n.size(); i++) {
                n[i] = n[i] * 10 + n[k+i];
            }
            k += plus+1;
        }
        amin = accumulate(n.begin(), n.begin()+plus+1, 0);
    }

    cout << amax << ' ' << amin << endl;
    
    return 0;
}