#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll inf = LONG_LONG_MIN / 2 - 1;
    ll n;
    cin >> n;
    vector<ll> d(n);
    rep(i, n) cin >> d[i];
    vector<ll> dp(1 << n, inf);
    dp[0] = 100;
    rep(bit, 1 << n) {
        if (dp[bit] == inf) continue;
        ll mhp = 100;
        rep(i, n) {
            if ((bit & (1 << i)) && (d[i] < 0)) {
                mhp += 100;
            }
        }
        rep(i, n) {
            if (bit & (1 << i)) continue;
            ll v = min(mhp, dp[bit] + d[i]);
            if (v <= 0) continue;
            ll idx = bit | (1 << i);
            dp[idx] = max(dp[idx], v);
        }
    }
    cout << ((dp[(1 << n) - 1] == inf) ? 0 : dp[(1 << n) - 1]) << endl;
    return 0;
}