#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int dp[1 << 16];
int N, D[16];

int main() {
	int good = 0;
	int bad = 0;
	cin >> N;
	rep (i, N) cin >> D[i];
	rep (i, N) {
		if (D[i] > 0) {
			good |= 1 << i;
		} else {
			bad |= 1 << i;
		}
	}

	dp[0] = 100;
	rep (i, 1 << N) {
		if (dp[i] <= 0) continue;
		int level = __builtin_popcount(i & bad) + 1;

		rep (j, N) {
			if (i & 1 << j) continue;
			dp[i | 1 << j] = max(dp[i | 1 << j], min(level * 100, dp[i] + D[j]));
		}
	}

	int ans = dp[(1 << N) - 1];

	if (ans <= 0) ans = 0;
	cout << ans << endl;

	return 0;
}