#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll inf = 1e18+7;


int main()
{
    int n, i, plus = 0, minus = 0;
    long long max = 0, min = 0;
    char card;
    deque<int> numbercards;
    cin >> n;

    for (i = 0; i < n; ++i) {
        cin >> card;
        if (isdigit(card))numbercards.push_back(card - '0');
        else if (card == '+')plus++;
        else if (card == '-')minus++;
    }
    sort(numbercards.begin(), numbercards.end());
    deque<int> numbercards_copy(numbercards);
    /*Max*/
    for (i = 0; i < n - 2 * (plus + minus); ++i) {
        max *= 10;
        max += numbercards.back(); numbercards.pop_back();
    }
    for (i = 0; i < plus; ++i) {
        max += numbercards.back(); numbercards.pop_back();
    }
    for (i = 0; i < minus; ++i) {
        max -= numbercards.back(); numbercards.pop_back();
    }
    /*min*/
    if (minus) {
        plus++; minus--;
        for (i = 0; i < n - 2 * (plus + minus); ++i) {
            min *= 10;
            min -= numbercards_copy.back(); numbercards_copy.pop_back();
        }
        for (i = 0; i < minus; ++i) {
            min -= numbercards_copy.back(); numbercards_copy.pop_back();
        }
        for (i = 0; i < plus; ++i) {
            min += numbercards_copy.back(); numbercards_copy.pop_back();
        }
    }
    else {
        int keta = 1;
        for (;;){
            for (i = 0; i < plus + 1;++i){
                min+=numbercards_copy.back() * keta; numbercards_copy.pop_back();
                if (numbercards_copy.size() == 0) goto result;
            }
            keta *= 10;
        }
    }
    result:
    cout << max << " " << min << endl;
    return 0;
}