#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int INF = 1e5;
ll MOD = 1e3;

int N;

int main(){
    cin >> N;
    int monster[N];
    rep(i,0,N) cin >> monster[i];

    int hp[1<<N];
    rep(i,0,1<<N) hp[i] = 0;
    hp[0] = 100;

    int hp_max[1<<N];
    rep(i,0,1<<N) hp_max[i] = 0;
    hp_max[0] = 100;

    rep(i,1,1<<N) rep(j,0,N){
        if(i&(1<<j)){
            if(monster[j] < 0) hp_max[i] = hp_max[i-(1<<j)] + 100;
            else hp_max[i] = hp_max[i-(1<<j)];
            break;
        }
    }

    rep(i,0,1<<N) {
        if (hp[i] == 0) continue;
        rep(j,0,N) if((i & (1 << j)) == 0){
            int k;
            k = min(hp[i] + monster[j], hp_max[i+(1<<j)]);
            hp[i+(1<<j)] = max(hp[i+(1<<j)], k);
        }
    }

    cout << hp[(1<<N)-1]<< endl;
}