//https://ncode.syosetu.com/n4830bu/297/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int N;
    cin >> N;
    vector<int> digit;
    vector<int> sign;
    for (int i = 0; i < N; i++) {
        char c;
        cin >> c;
        if (isdigit(c))
            digit.emplace_back(c - '0');
        else
            sign.emplace_back(c == '+' ? 1 : -1);
    }
    int D = digit.size();
    int S = sign.size();

    //max
    ll MAX = 0;
    sort(begin(digit), end(digit), greater{});
    sort(begin(sign), end(sign), greater{});
    for (int i = 0; i < D - S; i++) {
        (MAX *= 10) += digit[i];
    }
    for (int i = 0; i < S; i++) {
        MAX += digit[i + D - S] * sign[i];
    }

    //min
    ll MIN = 0;
    if (sign.back() == -1) {
        sign.back() = 1;
        sort(begin(sign), end(sign));
        for (int i = 0; i < D - S; i++) {
            (MIN *= 10) -= digit[i];
        }
        for (int i = 0; i < S; i++) {
            MIN += digit[i + D - S] * sign[i];
        }
    } else {
        ll maine = 1;
        for (int i = 0; i < D; i++) {
            if (i && (i % (S + 1) == 0))
                maine *= 10;
            MIN += maine * digit[i];
        }
    }

    cout << MAX << " " << MIN << endl;
}