#include <bits/stdc++.h>
//#define int long long

using namespace std;
using LL = long long;
using P = pair<int, int>;
using Tapris = tuple<int, int, int>;

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

#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()

const int INF = (int)1e9;
const LL INFL = (LL)1e15;
const int MOD = 1e9 + 7;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

/*************** using variables ***************/
int n;
vector<int> d;
int dp[1 << 16];
/**********************************************/

bool contain(int mask, int pos){
    return ((mask & (1 << pos)) != 0);
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n;
    d.assign(n, 0);
    REP(i, n) cin >> d[i];
    REP(i, (1 << 16)) dp[i] = 0;

    dp[0] = 100;
    for(int mask = 1; mask < (1 << n); mask++){
        REP(i, n) if(contain(mask, i) && dp[mask ^ (1 << i)]){
            int level = 1;
            REP(j, n) if(contain(mask ^ (1 << i), j) && d[j] < 0) level++;
            int health = dp[mask ^ (1 << i)];
            if(d[i] < 0){
                health = max(health + d[i], 0);
            }else{
                health = min(health + d[i], level * 100);
            }
            
            dp[mask] = max(dp[mask], health);
        }
    }
    cout << dp[(1 << n) - 1] << endl;
}