#include <bits/stdc++.h>
using namespace std;
int n;
int d[16];
int dp[1<<16];
int main(){
	cin>>n;
	for(int i=0;i<n;i++)	cin>>d[i];
	dp[0]=100;
	priority_queue<tuple<int,int,int> > pq;
	pq.push(make_tuple(100,100,0));
	while(!pq.empty()){
		auto cur=pq.top();	pq.pop();
		int l=get<0>(cur);
		int ml=get<1>(cur);
		int now=get<2>(cur);
		if(l>dp[now])	continue;
		for(int i=0;i<n;i++){
			if(now&(1<<i))	continue;
			if(dp[now|(1<<i)]<dp[now]+d[i]){
				dp[now|(1<<i)]=dp[now]+d[i];
				if(d[i]>0)	dp[now|(1<<i)]=min(dp[now|(1<<i)],ml);
				pq.push(make_tuple(dp[now|(1<<i)],(d[i]<0)?ml+100:ml,now|(1<<i)));
			}
		}
	}
	cout<<dp[(1<<n)-1]<<endl;
	return 0;
}