// No.107 - モンスター
#include <iostream>
#include <vector>
using namespace std;

const int kMAX_N = 17;

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

int clear_mask;

int GetLevel(int mask) {
    int level = 1;
    for (int i = 0; i < N; i++) {
        if ((mask >> i) & 1 && D[i] < 0) {
            level++;
        }
    }
    return level;
}

bool GameClear(int mask) {
    return (mask & clear_mask) == clear_mask;
}

void Solve() {
    clear_mask = 0;
    for (int i = 0; i < N; i++) {
        if (D[i] < 0) clear_mask |= 1 << i;
    }

    int answer = 0;
    dp[0] = 100;
    for (int mask = 1; mask < (1 << N); mask++) {
        int level = GetLevel(mask);
        for (int monster = 0; monster < N; monster++) {
            if (!((mask >> monster) & 1)) continue;

            if (D[monster] > 0 && dp[mask & ~(1 << monster)] > 0) {
                dp[mask] = max(dp[mask], min(level * 100, dp[mask & ~(1 << monster)] + D[monster]));
            }
            if (D[monster] < 0 && dp[mask & ~(1 << monster)] + D[monster] > 0) {
                dp[mask] = max(dp[mask], dp[mask & ~(1 << monster)] + D[monster]);
            }
        }
        if (GameClear(mask)) answer = max(answer, dp[mask]);
    }
    cout << answer << endl;
}

int main() {
    cin >> N;

    for (int i = 0; i < N; i++) {
        cin >> D[i];
    }

    Solve();

    return 0;
}