#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

void pvec(vector<vector<int> > &dp){
	for(int i=0; i<dp.size(); i++){
		for(int j=0; j<dp[i].size(); j++){
			cerr << dp[i][j] << " ";
			
		}
		cerr << endl;
	}
}

int dfs(vector<int> &D, vector<vector<int> > &dp, int &N, int state, int MAX_HP){
	if(dp[state][MAX_HP] >= 0) return dp[state][MAX_HP];

	
	//前の相手
	for(int j=0; j<N; j++){
		//戦っていない相手
		if( (state & (1<<j)) == 0) continue;

		//ひとつ前の状態
		int before_state = ( state & ( ~(1<<j) ) );
		
		//ひとつ前の状態の最大体力
		int before_HP = MAX_HP - (D[j]<0?1:0);
		
		if(before_HP <= 0) continue;

		int tmp = dfs(D,dp,N, before_state, before_HP);
		if(tmp <= 0) continue;
		
		dp[state][MAX_HP] = min( max( dp[state][MAX_HP] , tmp + D[j]), MAX_HP*100);
	}

	
	
	return dp[state][MAX_HP];

}

int main(){
	int N;
	cin >> N;
	vector<int> D(N);
	int max_HP=1;
	for(int i=0; i<N; i++){
		cin >> D[i];
		if(D[i] < 0) max_HP++;
	}
	vector<vector<int> > dp(1<<N, vector<int>(max_HP+1, -1));
	dp[0][1] = 100;
	int ans = 0;
	ans = max( ans, dfs(D,dp,N, (1<<N)-1, max_HP) );
	cout << ans << endl;
	return 0;
}