#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

int dp[1<<20];
int N;
int D[20];

int main(void) {
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> D[i];
    }
    for (int i = 0; i < 1<<N; i++) dp[i] = -1;
    dp[0] = 100;
    for (int state = 0; state < 1<<N; state++) {
        if (dp[state] < 0) continue;
        int maxHP = 1;
        for (int i = 0; i < N; i++) {
            if (state>>i & 1) {
                if (D[i] < 0) maxHP++;
            }
        }
        maxHP *= 100;
        for (int i = 0; i < N; i++) {
            if (state>>i & 1) continue;
            if (D[i] > 0) {
                dp[state|1<<i] = max(min(dp[state] + D[i], maxHP), dp[state|1<<i]);
            } else {
                int HP = dp[state] + D[i];
                if (HP <= 0) continue;
                dp[state|1<<i] = max(dp[state] + D[i], dp[state|1<<i]);
            }
        }
    }
    cout << max(0, dp[(1<<N)-1]) << endl;
    return 0;
}