#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>

#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)

using namespace std;

int main()
{
	int n; cin >>n ;
	vector<int> D(n);
	rep(i,n) cin >> D[i];
	vector<int> dp((1<<n)+5); //hp((1<<n)+5);
	dp[0]=100;
	rep(i,(1<<n)) if(dp[i]>0){
		int mxhp=100;
		rep(j,n) if(((i>>j)&1) && D[j]<0 ) mxhp+=100;
		//printf("%d:%d:%d ",i,mxhp,dp[i]);
		rep(j,n){
			int mi = i | (1<<j);
			if(!(i>>j &1)){  
				if(D[j]<0 ) dp[mi] = max(dp[mi], dp[i] + D[j]);
				else dp[mi] = max(dp[mi], min(mxhp, dp[i]+D[j]));
			}
		}
	}
	cout << max(0, dp[(1<<n) -1]) << endl;
	return 0;
}