#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

int main(int argc, const char * argv[]) {
    
    // source code
    int N = inputValue();
    vector<int> A(N);
    rep(i, N){
        A[i] = inputValue();
    }
    
    vector<int> dp(1 << N);
    dp[0] = 100;
    
    rep(i, 1 << N){
        if (dp[i] == 0) {
            continue;
        }
        
        int m = 100;
        rep(j, N){
            m += ((i >> j) % 2 == 1 && A[j] < 0) ? 100 : 0;
        }
        
        rep(j, N){
            if ((i >> j) % 2 == 1) {
                continue;
            }
            
            int d = min(m, dp[i] + A[j]);
            dp[i + (1 << j)] = max(dp[i + (1 << j)], d);
        }
    }
    
    output(dp[(1 << N) - 1], 0);
    
    
    return 0;
}