#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep1(i,n) for(int i=1; i<=(n); i++)
#define sz(x) int(x.size())
#define all(x) (x).begin(),(x).end()
#define Q2 1000000007
#define Q 998244353
#define lINF LONG_LONG_MAX  //ll
#define iINF INT_MAX //int
#define yes "Yes"
#define no "No"
#define kotae cout<<ans<<endl;
#define dame { puts("0"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
using ll=long long;
using ull=unsigned long long;
using P=pair<int,int>;
using pqg=priority_queue<int,vector<int>,greater<int>>;
using vi=vector<int>;
using vi2=vector<vector<int>>;
using vi3=vector<vector<vector<int>>>;
using vl=vector<ll>;
using vl2=vector<vector<ll>>;
using vl3=vector<vector<vector<ll>>>;
using vs=vector<string>;
using vp=vector<P>;
using vp2=vector<vector<P>>;
void chmax(int &x, int y){ x=max(x,y); return; }
void chmin(int &x, int y){ x=min(x,y); return; }
void chmaxl(ll &x, ll y){ x=max(x,y); return; }
void chminl(ll &x, ll y){ x=min(x,y); return; }

int main() {  

  int n;
  cin >> n;
  vi d(n);
  rep(i,n) cin >> d[i];
  int s=1<<n;
  vi2 dp(s,vector<int>(n+1));
  dp[0][0]=100;
  rep(i,s)rep(j,n){
    if((i>>j)&1) continue;
    rep(k,n){
      if (d[j]>0) {
        if(dp[i][k]!=0) chmax(dp[i|(1<<j)][k], min((k+1)*100,dp[i][k]+d[j]));
      }
      else if(dp[i][k]+d[j]>0) chmax(dp[i|(1<<j)][k+1],dp[i][k]+d[j]);
    }
  }
  int ans=0;
  rep(i,n+1) chmax(ans,dp[s-1][i]);
  kotae;
  return 0;
}