#include<iostream>
#include<climits>
#include<set>
#include<map>
#include<vector>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<assert.h>
#include<numeric>
#include<bitset>

#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

typedef long long ll;
using namespace std;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 62;
const double PI = 2 * acos(0.0);
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return a ? gcd(b % a, a) : b; }

int N;
int D[20];
int dp[66000];
int main() {
	cin >> N;
	for (int i = 0; i < N; i++) cin >> D[i];
	dp[0] = 100;

	for (int msk = 0; msk < 1 << N; msk++) {
		int physical = 100;
		if (dp[msk] == 0) continue;
		for (int i = 0; i < N; i++) if ((msk & 1 << i) && D[i] < 0) physical += 100;
		for (int i = 0; i < N; i++) {
			if (msk & 1 << i) continue;
			int status;
			if (0 < D[i]) {
				status = min(dp[msk] + D[i], physical);
			}
			else {
				status = max(0, dp[msk] + D[i]);
			}

			chmax(dp[msk + (1 << i)], status);
		}
	}

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