#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

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

int main(void) {
    int i, j, l, n;
    int d[16];
    cin >> n;
    rep (i,n) cin >> d[i];
    dp[0][1] = 100;
    rep (i,1<<n) {
        rep (j,n) if ((i & 1<<j) == 0) {
            REP (l,1,16) {
                if (d[j] < 0)
                    dp[i|1<<j][l+1] = max(dp[i|1<<j][l+1],dp[i][l]+d[j]);
                else if (dp[i][l] > 0)
                    dp[i|1<<j][l] = max(dp[i|1<<j][l],min(l*100,dp[i][l]+d[j]));
            }
        }
    }
    int ans = 0;
    REP (l,1,16) ans = max(ans,dp[(1<<n)-1][l]);
    cout << ans << endl;
    return 0;
}