#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define ALL(a)     (a).begin(),(a).end()
#define RALL(a)     (a).rbegin(),(a).rend()
#define PRINT(a)   cout << (a) << endl

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second

#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

using ll = long long int;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;

template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

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 (b<a) { a=b; return 1; } return 0; }

const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;

int main(){
  int n;
  cin >> n;
  vi d(n);
  REP(i,n)cin >> d[i];

  int S = (1<<n);
  vi dp(S,-1);
  dp[0] = 100;

  vi lv(S,1);
  REP(s, S){
    REP(i,n){
      if((s >> i) & 1 && d[i] < 0){
        lv[s]++;
      }
    }
  }

  REP(s, S){
    if(dp[s]==-1)continue;
    REP(i, n){
      if((s >> i) & 1)continue;

      if(d[i]>0){
        chmax(dp[s | (1<<i)],  min(100 * lv[s], dp[s]+d[i]));
      }else{
        if(dp[s] + d[i] > 0){
          chmax(dp[ s | (1<<i)], dp[s] + d[i]);
        }
      }
    }
  }

  // REP(s,S){
  //   printf("%d %d\n",s,dp[s]);
  // }

  cout << max(0, dp[S-1]) << endl;


}