arr = []v = []ans = [0,0,0]min = 2000def search(a, b): global v global min global ans c = sum(v) - a -b if a >= b and b >= c and a-c<min: ans[0] = a ans[1] = b ans[2] = c min = a-cn = int(input())v = list(map(int, input().split()))for i in range(2): u=[] for j in range(701): c = [0]*701 u.append(c) arr.append(u)arr[0][0][0] = 1for i in range(n): for j in range(701): for k in range(701): if (j-v[i]>-1 and k-v[i]>-1) and (arr[i%2][j][k]==1 or arr[i%2][j-v[i]][k]==1 or arr[i%2][j][k-v[i]]==1): arr[(i+1)%2][j][k] = 1for i in range(701): for j in range(701): if arr[n%2][i][j] == 1 : search(i,j)print(ans[0],ans[1],ans[2])
# arr = []# n = int(input())# for i in range(n):# c = [0]*n# arr.append(c)# arr[0][0] =1# for i in range(1,n):# for j in range(i+1):# if j-1<0:# arr[i][j]=arr[i-1][j]# else:# arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1]## for i in range(n):# for j in range(i+1):# print(arr[i][j],end=' ')# print()# mon = []# min = 10000# ans = 0# def search(m, cnt):# global ans# global mon# global min# if cnt>ans:# return# if m == 0:# if cnt<min:# min = cnt# for i in range(len(mon)-1, -1, -1):# if m-mon[i]>0:# print(m-mon[i], cnt+1)# search(m - mon[i], cnt + 1)### def greedy(a):# global ans# m = a# for i in range(len(mon)):# if(m//mon[i]>0):# ans += m//mon[i]# m %= mon[i]## w = int(input())# n = int(input())# mon = list(map(int, input().split()))# greedy(w)# search(w, 0)# print(min)# import threading## a, b = map(int, input().split())## def summ():# global a# global b# print('%.1f' %((a*b)/2))## th1 = threading.Thread(target = summ)# th1.start()def solution(sizes): answer = 0 c = [] flag = 0 for i in range(len(sizes)): for j in range(2): c.append(sizes[i][j]) c.sort() for i in range(len(sizes)): if sizes[i][0]==c[len(c)-1]: if sizes[i][1]==c[(len(c)-1)//2]: flag=1 if sizes[i][0]==c[(len(c)-1)//2]: if sizes[i][0]==c[len(c)-1]: flag=1 if flag==1: answer = c[len(c)-1]*c[(len(c)-1)//2+1] else: answer = c[len(c)-1] * c[(len(c)-1)//2] return answer# v = list(input())v = [[60, 50], [30, 70], [60, 30], [80, 40]]print(solution(v))