#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64,i64> P;
#define rep(i,s,e) for(int i = (s);i <= (e);i++)

int n;

int d[16];

int dp[(1 << 16)];

int main()
{
    cin >> n;
    rep(i,0,n - 1) cin >> d[i];
    
    fill(dp , dp + (1 << 16),-1e9);
    dp[0] = 100;

    rep(i,1,(1 << n) - 1)
    {
        rep(j,0,n - 1)
        {
            if(i & (1 << j))
            {
                //now take [j]
                int sub = i & ~(1 << j);
                //already die?
                if(dp[sub] <= 0) continue;
                int maxHP = 100;
                rep(k,0,n - 1)
                {
                    if(sub & (1 << k) && d[k] < 0) maxHP += 100;
                }
                if(d[j] > 0)
                {
                    dp[i] = max(dp[i] , min(dp[sub] + d[j] , maxHP));
                }
                else
                {
                    dp[i] = max(dp[i], dp[sub] + d[j]);
                }
            }
        }
    }

    if(dp[(1 << n) - 1] <= 0) dp[(1 << n) - 1] = 0;
    cout << dp[(1 << n) - 1] << endl;
}