#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n;
int dp[1<<16];
vector<int> a;

void solve(){
	dp[0] = 100;
	for(int bit =1;bit<(1<<n);bit++){
		dp[bit] = -10101010;
		int cap = 100;
		for(int i = 0;i<n;i++){
			if(bit>>i&1){
				if(a[i]<0)cap+=100;
			}
		}
		for(int i = 0;i<n;i++){
			if(bit>>i&1){
				int x = min(cap,dp[bit-(1<<i)]+a[i]);
				if(x>0){
					dp[bit] = max(dp[bit],x);
				}
			}
		}
	}
	cout<<max(0,dp[(1<<n)-1])<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	a = vector<int>(n);
	for(auto &i:a)cin >> i;
	solve();
}