#include <bits/stdc++.h>

using namespace std;

int dp[1 << 16];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> d(n);
	for (int i = 0; i < n; i++) cin >> d[i];
	dp[0] = 100;
	for (int i = 0; i < (1 << n) - 1; i++) {
		int max_hp = 100;
		for (int j = 0; j < n; j++) {
			if (i & (1 << j)) {
				if (d[j] < 0) max_hp += 100;
			}
		}
		for (int j = 0; j < n; j++) {
			if (i & (1 << j)) continue;
			if (d[j] > 0) {
				if (dp[i] == 0) continue;
				dp[i | (1 << j)] = max(dp[i | (1 << j)], min(dp[i] + d[j], max_hp));
			} else {
				dp[i | (1 << j)] = max(dp[i | (1 << j)], max(dp[i] + d[j], 0));
			}
		}
	}
	cout << dp[(1 << n) - 1] << endl;
	return 0;
}