#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n; cin >> n;
    vector<int> v;
    int plus = 0;
    int minus = 0;
    rep(i,n) {
        char c; cin >> c;
        if(c=='+') plus++;
        else if(c=='-') minus++;
        else {
            v.push_back(c-'0');
        }
    }

    sort(ALL(v));
    // for(auto e:v) cout << e << " ";

    // max
    int mx = 0;
    rep(i, minus) mx -= v[i];
    rep(i, plus) mx += v[i+minus];
    rep(i, v.size()-minus-plus) mx += pow(10, i) * v[i+minus+plus];

    cout << mx << " ";

    int mn = 0;
    rep(i, plus+1) mn += v[i];
    rep(i, minus) mn -= v[i+plus+1];
    rep(i, v.size()-plus-minus-1) mn -= pow(10, i+1) * v[i+plus+minus+1];

    cout << mn << endl;

    return 0;
}