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

dp = [0 for _ in range(1 << n)]
dp[0] = 100
for mask in range(1 << n):
  if dp[mask] <= 0:
    continue

  lv = 1
  for i in range(n):
    if (mask >> i) & 1 == 1 and d[i] < 0:
      lv += 1

  for i in range(n):
    if (mask >> i) & 1 == 1:
      continue

    nxt = mask | (1 << i)
    dp[nxt] = max(dp[nxt], min(dp[mask] + d[i], lv * 100))

print(dp[-1])