#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<char> c(n, 0);
    REP(i, 0, n) {
        cin, c[i];
    }
    int sz = 1 << n;
    const ll inf = 1LL << 60;
    auto dpmin = make_v(sz, inf), dpmax = make_v(sz, -inf);
    REP(bit, 0, sz) {
        bool check = true;
        REP(i, 0, n) {
            if ((bit >> i) & 1) {
                check &= isdigit(c[i]);
            }
        }
        if (check) {
            vector<int> a;
            REP (i, 0, n) {
                if ((bit >> i) & 1) {
                    a.push_back(c[i] - '0');
                }
            }
            sort(a.begin(), a.end());
            dpmin[bit] = dpmax[bit] = 0;
            REP (i, 0, a.size()) {
                dpmin[bit] = dpmin[bit] * 10 + a[i];
                dpmax[bit] = dpmax[bit] * 10 + a[a.size() - 1 - i];
            }
        }
    }
    
    REP (bit, 0, sz) {
        REP (i, 0, n) {
            if (((bit >> i) & 1) && (!isdigit(c[i])))  {
                int mbit = bit & (~(1 << i));
                for (int j = bit; j > 0; j = (j - 1) & bit) {
                    int comp1 = j & mbit;
                    int comp2 = (~j) & mbit;
                    if (comp1 == 0 || comp2 == 0) continue;
                    if (c[i] == '+') {
                        chmin(dpmin[bit], dpmin[comp1] + dpmin[comp2]);
                        chmax(dpmax[bit], dpmax[comp1] + dpmax[comp2]);
                    } else {
                        chmin(dpmin[bit], dpmin[comp1] - dpmin[comp2]);
                        chmin(dpmin[bit], dpmin[comp2] - dpmin[comp1]);
                        chmin(dpmin[bit], dpmin[comp1] - dpmax[comp2]);
                        chmin(dpmin[bit], dpmin[comp2] - dpmax[comp1]);

                        chmax(dpmax[bit], dpmax[comp1] - dpmax[comp2]);
                        chmax(dpmax[bit], dpmax[comp2] - dpmax[comp1]);
                        chmax(dpmax[bit], dpmax[comp1] - dpmin[comp2]);
                        chmax(dpmax[bit], dpmax[comp2] - dpmin[comp1]);
                    }
                }
            }
        }
    }
    print(dpmax[sz - 1], dpmin[sz - 1]);
    return 0;
}