//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    int pc = 0;
    int mc = 0;
    vector<int> a;
    rep(i, n)
    {
        char temp;
        cin >> temp;
        if (temp == '+')
            pc++;
        else if (temp == '-')
            mc++;
        else
            a.push_back(temp - '0');
    }


    sort(ALL(a), greater<int>());
    vector<ll> b;
    int m = a.size() - (pc + mc);
    ll base =1;
    ll big =0 ;
    for(int i = m-1;i>=0;i--){
        big+=base*a[i];
        base*=10;
    }
    b.push_back(big);
    for(int i=m;i<a.size();i++){
        b.push_back(ll(a[i]));
    }
    ll ansm=b[0];
    int pcc=pc;
    int mcc=mc;
    rep(i,b.size()-1){
        if(pcc){
            ansm+=b[i+1];
            pcc--;
        }
        else{
            ansm-=b[i+1];
        }
    }
    cout<<ansm<<" ";

    reverse(ALL(b));
    ansm = b[0];
    rep(i, b.size() - 1)
    {
        if (pc)
        {
            ansm += b[i + 1];
            pc--;
        }
        else
        {
            ansm -= b[i + 1];
        }
    }
    cout << ansm << "\n";
}