#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define mp make_pair
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int dp[(1 << 16) + 10] = {};
//dp[i]=iの内ビットが立ってるのが倒した.ときの体力の残り.
//dp[i]+立ってないやつ
int main()
{
    int n;
    cin >> n;
    int d[10005];
    rep(i, n) cin >> d[i];
    dp[0] = 100;
    rep(i, 1 << n)
    {
        vector<int> done, sel;
        if (dp[i] == 0)
            continue;
        int hp_max = 100;
        rep(j, n)
        {
            if ((i >> j) & 1)
                done.push_back(j);
            else
                sel.push_back(j);
        }
        for (auto j : done) {
            if (d[j] < 0)
                hp_max += 100;
        }
        for (auto j : sel) {
            if (d[j] > 0)
                dp[i + (1 << j)] = max(dp[i + (1 << j)], min(dp[i] + d[j], hp_max));
            else
                dp[i + (1 << j)] = max(dp[i + (1 << j)], dp[i] + d[j]);
        }
    }
    cout << dp[(1 << n) - 1] << endl;
}