#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 dp[2][1<<16];

int D[20];
int main(){
    int N;
    cin >> N;
    REP(i,N) cin >> D[i];

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

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

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