#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

bool isdigit(char c) {
    return '0' <= c && c <= '9';
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin, n;
    vector<int> num;
    int plus = 0, minus = 0;
    REP(i, 0, n) {
        char c;
        cin, c;
        if (isdigit(c)) {
            num.push_back(c - '0');
        } else {
            if (c == '+')
                plus++;
            else
                minus++;
        }
    }
    sort(num.rbegin(), num.rend());
    ll mn = 0, mx = 0;
    {
        REP(i, 0, num.size() - plus - minus) {
            mx = mx * 10 + num[i];
        }
        REP(i, num.size() - plus - minus, num.size() - minus) {
            mx += num[i];
        }
        REP(i, num.size() - minus, num.size()) {
            mx -= num[i];
        }
    }
    if (minus) {
        minus--;
        plus++;
        REP(i, 0, num.size() - plus - minus) {
            mn = mn * 10 + num[i];
        }
        mn = -mn;
        REP(i, num.size() - plus - minus, num.size() - plus) {
            mn -= num[i];
        }
        REP(i, num.size() - plus, num.size()) {
            mn += num[i];
        }
    } else {
        vector<ll> res(plus + 1, 0);
        reverse(num.begin(), num.end());
        int a = 0;
        REP (i, 0, num.size()) {
            res[a] = res[a] * 10 + num[i];
            a = (a + 1) % res.size();
        }
        for (ll p : res) {
            mn += p;
        }
    }

    print(mx, mn);

    return 0;
}