#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>
#include <complex>

#define INF 100000000
#define EPS 1e-9
#define Pi acos(-1)

using namespace std;

typedef long long ll;

#define MAX_N 16

int N;
int D[MAX_N];

int dp[(1 << MAX_N) + 1];

//S:倒した敵 currentLife:現在の体力
int solve(int S, int currentLife){

	if (dp[S] != -1)
		return dp[S];
	if (S == (1 << N) - 1)
		return currentLife;
	if (currentLife == 0)
		return 0;

	int maxLife = 1;

	for (int i = 0; i < N; i++){
		if (S >> i & 1 && D[i] < 0)
			maxLife++;
	}

	maxLife = maxLife * 100;

	int tmp = 0;

	for (int i = 0; i < N; i++){
		if (!(S >> i & 1)){
			//いいモンスター
			if (D[i] > 0){
				tmp = max(tmp, solve(S | 1 << i, min(maxLife, currentLife + D[i])));
			}
			//悪いモンスター
			else{
				tmp = max(tmp, solve(S | 1 << i, max(0, currentLife + D[i])));
			}
		}
	}

	return dp[S] = tmp;

}

int main(){

	cin >> N;
	for (int i = 0; i < N; i++){
		cin >> D[i];
	}

	memset(dp, -1, sizeof(dp));

	cout << solve(0, 100) << endl;

	return 0;

}