#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n;
  cin>>n;
  vector<int>d(n);
  rep(i,n)cin>>d[i];
  vector<vector<int>>dp(n+1,vector<int>(1<<n,-1e9));
  dp[0][0]=100;
  rep(i,n){
    rep(j,1<<n){
      int mx=100;
      rep(k,n)if((j&(1<<k))&&(d[k]<0))mx+=100;
      rep(k,n)if(dp[i][j]+d[k]>0&&!(j&(1<<k)))chmax(dp[i+1][j|(1<<k)],min(mx,dp[i][j]+d[k]));
    }
  }
  if(dp[n][(1<<n)-1]==-1e9)cout<<0<<endl;
  else cout<<dp[n][(1<<n)-1]<<endl;
}