#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <set>
#include <map>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int dp[1<<17][19];

int main() {

  int N; cin >> N;
  int D[N];
  rep(i, N) { cin >> D[i]; }

  dp[0][1] = 100;
  for(int S=0; S<(1<<N); S++) {
    for(int W=1; W<18; W++) {
      if(dp[S][W] <= 0) { continue; }
      for(int i=0; i<N; i++) {
        if(!(S >> i & 1)) {
          if(D[i] < 0) {
            if(dp[S][W]+D[i] <= 0) { continue; }
            dp[S|(1<<i)][W+1] = max(dp[S|(1<<i)][W+1], dp[S][W]+D[i]);
          }
          else {
            dp[S|(1<<i)][W] = max(dp[S|(1<<i)][W], min(W*100, dp[S][W]+D[i]));
          }
        }
      }
    }
  }

  int ans = 0;
  REP(i,1,18) { ans = max(ans, dp[(1<<N)-1][i]); }
  cout << ans << endl;

  return 0;
}