#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int D[16], dp[1<<16];

int main(){
    int N, mask = 0;
    cin >> N;
    REP(i,N){
        cin >> D[i];
        if(D[i] < 0) mask |= 1<<i;
    }

    REP(j,1<<N) dp[j] = -1;
    dp[0] = 100;

    REP(i,1<<N){
        if(dp[i] < 0) continue;
        REP(j,N){
            if(i & (1<<j)) continue;
            if(D[j] > 0){
                // 回復
                int nextv = max(dp[i + (1<<j)], dp[i] + D[j]);
                dp[i + (1<<j)] = min((__builtin_popcount(i&mask)+1)*100, nextv);
            } else {
                // 敵
                int nextv = dp[i] + D[j];
                if(nextv > 0){
                    dp[i + (1<<j)] = max(dp[i + (1<<j)], nextv);
                }
            }
        }
    }

    cout << max(0, dp[(1<<N)-1]) << endl;
    return 0;
}