#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <sstream>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>

#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define iter(a) __typeof(a.begin())
#define FOR(it,a) for(iter(a)it=a.begin();it!=a.end();++it)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define sz(a) SZ(a)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) (a).begin(),(a).end()
using namespace std;

typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;

#define PR(...) do{cerr << "line : " << __LINE__ << endl; pr(#__VA_ARGS__, __VA_ARGS__);}while(0);
template<class T>
void pr(const string& name, T t){
  cerr << name << ": " << t << endl;
}

template<typename T, typename ... Types>
void pr(const string& names, T t, Types ... rest) {
  auto comma_pos = names.find(',');
  cerr << names.substr(0, comma_pos) << ": " << t << ", ";
  
  auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);
  pr(string(names, next_name_pos), rest ...);
}

template<class T,class U> ostream& operator<< (ostream& o, const pair<T,U>& v){return o << "(" << v.F << ", " << v.S << ")";}
template<class T> ostream& operator<< (ostream& o, const vector<T>& v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";}

const int dx[] = {0,1,0,-1};
const int dy[] = {-1,0,1,0};
#define endl '\n'


int in[16];

int memo[1<<16];
bool vis[1<<16];
int n;
int rec(int st){
  if(!st) return 100;
  if(vis[st]) return memo[st];
  int inf = 1<<25;
  int& ret = memo[st] = -inf;
  vis[st] = 1;
  int lim = 100;
  rep(i,n) if(((st>>i)&1) && in[i] <=0) lim += 100;
  
  rep(i,n){
    if((~st>>i)&1) continue;
    ret = max(ret, min(rec(st^(1<<i)) + in[i],lim));
    if(ret <= 0) ret = -inf;
  }
  return ret;
}

int main(int argc, char *argv[])
{
  cin >> n;
  rep(i,n) cin >> in[i];

  cout << max(rec((1<<n)-1),0) << endl;
  
  return 0;
}