#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
#include <queue>
#include <map>
#include <cstring>
#include <algorithm>
#define INF 114514

using namespace std;

int dp[20][1<<16+1];

int main(void){
	int n;
	cin >> n;
	vector<int> d(n);
	for(int i=0;i<n;i++)
		cin >> d[i];
	for(int i=0;i<20;i++)for(int j=0;j<(1<<n);j++)dp[i][j] = -INF;

	dp[0][0] = 100;
	for(int i=0;i<20;i++){
		for(int j=0;j<(1<<n);j++){
			if(dp[i][j] <= 0)continue;
			for(int k=0;k<n;k++){
				if(j&(1<<k))continue;
				if(d[k] < 0)
					dp[i+1][j|(1<<k)] = min((i+1)*100,dp[i][j] + d[k]);
				else
					dp[i][j|(1<<k)] = min((i+1)*100,dp[i][j] + d[k]);
			}
		}
	}

	int ret =0;
	for(int i=0;i<20;i++){
		// cout << dp[i][(1<<n)-1] << endl;
		ret = max(dp[i][(1<<n)-1],ret);
	}
	cout << max(0,ret) << endl;
	return 0;
}