// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

int dp[(1<<16)+1];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> d(n);
  cin >> d;
  dp[0] = 100;
  for(int i = 1; i < (1 << n); i++){
    int maxi = 100;
    for(int j = 0; j < n; j++){
      if((i >> j) % 2 == 1 && d[j] < 0)maxi += 100;
    }
    for(int j = 0; j < n; j++){
      if((i >> j) % 2 == 1){
        int st = i ^ (1 << j);
        int tmp = dp[st];
        if(tmp <= 0)continue;
        if(d[j] < 0){
          if(tmp + d[j] > 0)dp[i] = max(dp[i], tmp + d[j]);
        }else{
          dp[i] = max(dp[i], min(maxi, tmp + d[j]));
        }
      }
    }
    //cout << bitset<16>(i) << " " << dp[i] << endl;
  }
  cout << dp[(1<<n)-1] << endl;
	return 0;
}