#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)

int N;
//int maxhp(vector<int> D, int hp, int ceilhp) {
//    if (D.empty()) return hp;
//    int mh = 0;
//    REP(i,D.size()) {
//        int h = min(hp + D[i], ceilhp);
//        if (h <= 0) continue; // 死亡
//        vector<int> tmp;
//        for (int j : D) tmp.push_back(j);
//        tmp.erase(tmp.begin() + i);
//        mh = max(mh, maxhp(tmp, h, ceilhp + ((D[i]<0)?100:0)));
//    }
//    return mh;
//}

vector<int> D(16);
int ceilhp(int n) {
    int ret = 100;
    REP(i,N) {
        if (n & 1<<i && D[i] < 0) {
            ret += 100;
        }
    }
    return ret;
}

signed main()
{
    cin >> N;
    REP(i,N) cin >> D[i];
    int dp[(1<<16)*2] = {0};
    dp[0] = 100;
    REP(i,1<<N) {
        bitset<16> bs = bitset<16>(i);
        int maxhp = dp[i];
        REP(j,16) {
            if (bs[j] == 0) continue;
            int k= i - (1<<j);
            if (dp[k] == 0) continue;
            int ceil = ceilhp(k);
            maxhp = max(maxhp, min(ceil, D[j] + dp[k]));
        }
        dp[i] = maxhp;
    }
    cout << dp[(1<<N)-1] << endl;
    return 0;
}