#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>

using namespace std;

int main(){

    long long N, mx, cnt;
    cin >> N;
    mx = 1LL<<N;
    vector<long long> D(N);
    for (int i=0; i<N; i++) cin >> D[i];

    vector<long long> dp(mx, -1e18);
    dp[0] = 100;

    for (int i=0; i<mx; i++){
        for (int j=0; j<N; j++){
            if (!(i & 1LL<<j)){
                if (D[j] < 0){
                    dp[i|(1LL<<j)] = max(dp[i|(1LL<<j)], dp[i]+D[j]);
                    if (dp[i|(1LL<<j)] <= 0) dp[i|(1LL<<j)] = -1e18;
                }
                else{
                    cnt = 0;
                    for (int k=0; k<N; k++) if (i & 1LL<<k) cnt++;
                    dp[i|(1LL<<j)] = max(dp[i|(1LL<<j)], min(dp[i]+D[j], (cnt+1) * 100));
                }
            }
        }
    }

    cout << max(dp[mx-1], 0LL) << endl;

    return 0;
}