def solve(N, A):
    dp = [-float("inf")] * (1 << N)
    dp[0] = 100
    for V in range(1 << N):
        for i, a in enumerate(A):
            if (V >> i) & 1:
                continue
            max_hp = 100
            for j, b in enumerate(f"{V:0{N}b}"[::-1]):
                if b == "1" and A[j] < 0:
                    max_hp += 100
            VV = V | (1 << i)
            if a > 0:
                hp = min(max_hp, dp[V] + a)
            else:
                hp = max(0, dp[V] + a)
                if hp == 0:
                    hp = -float("inf")
            dp[VV] = max(dp[VV], hp)

    ans = max(0, dp[-1])

    return ans


def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = solve(N, A)
    print(ans)


if __name__ == "__main__":
    main()