import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)] def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10**9) INF = 10**18 MOD = 10**9 + 7 EPS = 10**-10 N = INT() A = [] add = sub = 0 for s in input().split(): if s == '+': add += 1 elif s == '-': sub += 1 else: A.append(s) A.sort(reverse=1) N = len(A) blank = N - add - sub - 1 B = [' ']*blank + ['+']*add + ['-']*sub M = len(B) memo = {} useda = [0] * N usedb = [0] * M def rec1(s): i = len(s) if s in memo: return memo[s] if i == N+M: return eval(s.replace(' ', '')) res = INF if i % 2 == 0: for j in range(N): if not useda[j]: useda[j] = 1 res = min(res, rec1(s + A[j])) useda[j] = 0 else: for j in range(M): if not usedb[j]: usedb[j] = 1 res = min(res, rec1(s + B[j])) usedb[j] = 0 memo[s] = res return res mn = rec1('') memo = {} useda = [0] * N usedb = [0] * M def rec2(s): i = len(s) if s in memo: return memo[s] if i == N+M: return eval(s.replace(' ', '')) res = -INF if i % 2 == 0: for j in range(N): if not useda[j]: useda[j] = 1 res = max(res, rec2(s + A[j])) useda[j] = 0 else: for j in range(M): if not usedb[j]: usedb[j] = 1 res = max(res, rec2(s + B[j])) usedb[j] = 0 memo[s] = res return res mx = rec2('') print(mx, mn)