#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define FOR(i, a, n) for(int i=a; i<n; i++)
#define RFOR(i, a, n) for(int i=n-1; i>=a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FOR(i, 0, n)

int dp[(1 << 16)];
int main()
{
	int N;
	int D[17];
	cin >> N;
	REP(i, N) cin >> D[i];
	REP(i, 1 << N) dp[i] = 0;
	
	dp[0] = 100;
	REP(mask, 1 << N) {
		if (dp[mask] <= 0) continue;

		int maxHP = 100;
		REP(i, N) {
			if (mask&(1 << i) && D[i] < 0) maxHP += 100;
		}
		REP(i, N) {
			if (mask&(1 << i)) continue;
			int next = min(maxHP, dp[mask] + D[i]);
			dp[mask | (1 << i)] = max(dp[mask | (1 << i)], next);
		}
	}

	cout << dp[(1 << N) - 1] << endl;
	return 0;
}