#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=1e18+7;
const ll MOD=1e9+7;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll n;
	cin >> n;
	vector<ll> D(n);
	FOR(i,0,n)cin >> D[i];
	ll dp[1<<n][n];
	FOR(i,0,1<<n){
		FOR(j,0,n){
			dp[i][j] = -1;
		}
	}
	if(n==1){
		ll ans = max(D[0]+100,0ll);
		if(ans>0){
			cout << min(100ll,ans) << endl;
		}else{
			cout << 0 << endl;
		}
		return 0;
	}
	FOR(i,0,n)dp[0][0]=100;
	//dp[done][LEVEL] = leave HP;
	FOR(i,0,(1<<n)){
		FOR(j,0,n){
			FOR(k,0,n){
				if(dp[i][j]>0)if(!(i&(1<<k))){
					if(D[k]>=0){
						dp[i|1<<k][j] = max(dp[i|1<<k][j],dp[i][j]+D[k]);
						if(dp[i|1<<k][j]>(j+1)*100)dp[i|1<<k][j] = (j+1)*100;
					}else{
						dp[i|1<<k][j+1] = max(dp[i|1<<k][j+1],dp[i][j]+D[k]);
						if(dp[i|1<<k][j+1]<0)dp[i|1<<k][j+1]=-1;
					}
				}
			}
		}
	}
	ll ans = -1;
	FOR(i,0,n)ans = max(ans,dp[(1<<n)-1][i]);
	if(ans<=0){
		cout << 0 << endl;
	}else{
		cout << ans << endl;
	}
}