#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;

int main(){
	int n,mon[20];
	cin >> n;
	vector<int> dp(1 << n);
	for(int i=0;i<n;i++) cin >> mon[i];
	dp[0] = 100;
	for(int i=0;i<(1<<n);i++){
		if(dp[i] == 0) continue;
		int hp = 100;
		for(int j=0;j<n;j++){
			if((i&(1<<j)) && mon[j] < 0) hp += 100;
		}
		for(int j=0;j<n;j++){
			if((i&(1<<j))) continue;
			int tmp = min(hp,dp[i]+mon[j]);
			dp[i + (1 << j)] = max(dp[i + (1 << j)],tmp);
		}
	}
	cout << dp[(1<<n)-1] << endl;
}