import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void log(A...)(A arg) { stderr.writeln(arg); }
int size(T)(in T s) { return cast(int)s.length; }

void main() {
    int N; readf("%d\n", &N);
    auto D = readln.chomp.split(" ").map!(to!int).array;

    const INF = int.max / 8;

    int[int] memo;
    int f(int set) {
        if (set == 0) return 100;
        if (set in memo) return memo[set];

        int next_hp(int cur_hp, int mid, int bit) { // mid: monster id, bit: 蛟偵＠縺溘Δ繝ｳ繧ｹ繧ｿ繝ｼ縺ｮid縺ｮ髮・粋
            int max_hp = 100;
            if (D[mid] < 0) {
                return cur_hp + D[mid] <= 0 ? -INF : cur_hp + D[mid];
            } else {
                for (int i = 0; i < N; i++) {
                    if (bit & (1 << i)) {
                        if (D[i] < 0) max_hp += 100;
                    }
                }
                return min(cur_hp + D[mid], max_hp);
            }
            
        }

        int ans = -INF;
        for (int i = 0; i < N; i++) {
            if (set & (1 << i)) {
                int hp = next_hp(f(set - (1 << i)), i, set);
                ans = max(ans, hp);
            }
        }
        return memo[set] = ans;
    }
    writeln(max(0, f((1 << N) - 1)));
//    foreach (k, v; memo) {
//        log(k, " -> ", v);
//    }
}