#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

int dp[1 << 17];

void init()
{
    for (int i = 0; i < (1 << 17); i++)
    {
        dp[i] = -1;
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    init();
    int n;
    cin >> n;
    vector<int> d(n);
    for (int i = 0; i < n; i++)
    {
        cin >> d[i];
    }
    dp[0] = 100;
    for (int S = 0; S < (1 << n); S++)
    {
        if (dp[S] <= 0)
        {
            continue;
        }
        int maxHp = 100;
        for (int i = 0; i < n; i++)
        {
            if (S & (1 << i) && d[i] < 0)
            {
                maxHp += 100;
            }
        }
        for (int i = 0; i < n; i++)
        {
            if (S & (1 << i))
            {
                continue;
            }
            int next = S + (1 << i);
            chmax(dp[next], min(maxHp, dp[S] + d[i]));
        }
    }
    int ans = max(dp[(1 << n) - 1], 0);
    cout << ans << endl;
}