from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    def ng(pc):
        pm=["+","-"]
        if pc[0] in pm or pc[-1] in pm:
            return True
        for c0,c1 in zip(pc,pc[1:]):
            if c0 in pm and c1 in pm:
                return True
        return False

    inf=10**16
    n=II()
    cc=input().split()
    mn=inf
    mx=-inf
    for pc in permutations(cc):
        if ng(pc):continue
        val=eval("".join(pc))
        if val<mn:mn=val
        if val>mx:mx=val
    print(mx,mn)

main()