package no107;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] d = new int[n];
		for(int i=0;i<n;i++) {
			d[i] = sc.nextInt();
		}
		int[] dp = new int[1<<n];
		Arrays.fill(dp, -(1<<29));
		dp[0] = 100;
		for(int i=0;i<(1<<n);i++) {
			int maxhp = 100;
			for(int j=0;j<n;j++) {
				if ((i>>j & 1) > 0 && d[j] < 0) {
					maxhp += 100;
				}
			}
			for(int j=0;j<n;j++) {
				if ((i>>j & 1) > 0) {
					int k = i ^ 1<<j;
					if (d[j] < 0) {
						dp[i] = Math.max(dp[i], dp[k] + d[j]);
					}else{
						dp[i] = Math.max(dp[i], Math.min(dp[k] + d[j], maxhp));
					}
					if (dp[i] <= 0) {
						dp[i] = -(1<<29);
					}
				}
			}
		}
		int ans = dp[(1<<n)-1];
		System.out.println(ans < 0 ? 0 : ans);
	}

}