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

using namespace std;

int dp[1<<16+1];
vector<int> d;
int n;

int dfs(long long bit){
	int ret=-114514;
	int cnt = 1;
	for(int i=0;i<n;i++)if(!(bit&1<<i) && d[i]<0)cnt++;

	if(dp[bit] != -1)return dp[bit];
	if((1<<n)-1 == bit)return 100;

	for(int i=0;i<n;i++){
		if(!(bit&(1<<i))){
			ret = max(ret,dfs(bit|(1<<i))+d[i]);
		}
	}
	ret = min(cnt*100,ret);

	if(ret <= 0)return -114514;
	return dp[bit]=ret;
}

int main(void){
	cin >> n;
	d.resize(n);
	for(int i=0;i<n;i++)
		cin >> d[i];
	memset(dp,-1,sizeof(dp));
	int hp = 100;
	
	cout << max(0,dfs(0)) << endl;

	return 0;
}