import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
import java.util.BitSet;

public class Prob107 {
	public static BitSet intToBitset(int size, int n) {
		BitSet b = new BitSet(size);
		for(int k=0; k<size; k++) {
			if(n%2==1) b.set(k);
			n /= 2;
		}
		return b;
	}

	public static int bitsetToInt(int size, BitSet b) {
		int n = 0;
		for(int i=0; i<size; i++) {
			if(b.get(i)) n += (int)Math.pow(2, i);
		}
		return n;
	}

	public static void main(String[] args) {
		FS r = new FS();
		int N = r.nextInt();
		int[] D = new int[N];
		for(int i=0; i<N; i++) {
			D[i] = r.nextInt();
		}
		int size = (int)Math.pow(2, N);
		// max_hp, defeated_num
		int[][] dp = new int[2][size];
		for(int i=0; i<dp.length; i++) {
			dp[0][i] = 0;
			dp[1][i] = 0;
		}
		dp[0][0] = 100;
		dp[1][0] = 1;
		for(int i=1; i<size; i++) {
			BitSet bit = intToBitset(N, i);
			int idx = 0;
			while(0<=idx) {
				idx = bit.nextSetBit(idx);
				if(idx<0) break;
				BitSet tmp = new BitSet(N);
				tmp.set(idx);
				tmp.xor(bit);
				int tmpIdx = bitsetToInt(N, tmp);
				if(0 < D[idx]) {
					if(0 < dp[0][tmpIdx]) {
						if(dp[0][i] < Math.min(dp[0][tmpIdx]+D[idx], dp[1][tmpIdx]*100)) {
							dp[0][i] = Math.min(dp[0][tmpIdx]+D[idx], dp[1][tmpIdx]*100);
							dp[1][i] = dp[1][tmpIdx];
						}
					}
				} else {
					if(dp[0][i] < dp[0][tmpIdx]+D[idx]) {
						dp[0][i] = dp[0][tmpIdx]+D[idx];
						dp[1][i] = dp[1][tmpIdx]+1;
					}
				}
				idx++;
			}
		}
		System.out.println(dp[0][size-1]);
	}
	
	// Read Class
	static class FS {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;
		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}
	
		private int readByte() { return hasNextByte() ? buffer[ptr++] : -1;}
		private boolean isPrintableChar(int c) {return 33 <= c && c <= 126;}
		private void skipUnprintable() {while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	
		public boolean hasNext() { skipUnprintable(); return hasNextByte();}
		public String next() {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while(isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public int nextInt() {
			return (int)nextLong();
		}
		public long nextLong() {
			if (!hasNext()) throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while(true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if(b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}
	}
}