#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;cin>>n;
    int p=0,m=0;
    vector<int> v;
    for (int i=0;i<n;i++) {
        char c;cin>>c;
        if (c=='+') p++;
        else if (c=='-') m++;
        else v.push_back(c-'0');
    }
    sort(v.begin(),v.end());
    ll mx=0,mn=0;
    int l=0,r=v.size()-1;
    for (int i=0;i<m;i++) {
        mx-=v[l];
        l++;
    }
    for (int i=0;i<p;i++) {
        mx+=v[l];
        l++;
    }
    ll mul=1;
    while (l<v.size()) {
        mx+=v[l]*mul;
        l++;
        mul*=10;
    }

    if (m==0) {
        reverse(v.begin(),v.end());
        mul=1;
        for (int i=0;i<v.size();i++) {
            mn+=v[i]*mul;
            if (i%(p+1)==p)
                mul*=10;
        }
    } else {
        l=0;
        mn=v[l];
        l++;
        for (int i=0;i<p;i++) {
            mn+=v[l];
            l++;
        }
        for (int i=0;i<m-1;i++) {
            mn-=v[l];
            l++;
        }
        mul=1;
        while (l<v.size()) {
            mn-=v[l]*mul;
            l++;
            mul*=10;
        }
    }
    cout<<mx<<' '<<mn<<endl;
    return 0;
}