import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

n = int(input())
d = list(map(int, input().split()))


l = defaultdict(int)

for i in range(1 << n):
  l[i] = 100

for i in range(1 << n):
  for j in range(n):
    if((i >> j) & 1) == 1:
      if d[j] < 0:
        l[i] += 100
dp = defaultdict(lambda:defaultdict(int))
dp[0][0] = 100
for i in range(1, n + 1):
  for j in range(1 << n):
    for k in range(n):
      # print('A:',i,j,k,dp[i][j | (1 << k)],'{:b}'.format(j | (1 << k)),l[j])  
      if j & (1 << k) == 0 and dp[i - 1][j] != 0:
        dp[i][j | (1 << k)] = max(dp[i][j | (1 << k)], min(max(dp[i - 1][j] + d[k], 0), l[j]))
        # print('B:',i,j,k,dp[i][j | (1 << k)])        
print(dp[n][(1 << n) - 1])