#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> d(n);
    for(int i=0; i<n; ++i)
        cin >> d[i];

    vector<int> dp(1<<n, 0);
    dp[0] = 100;
    for(int i=0; i<(1<<n); ++i){
        if(dp[i] == 0)
            continue;

        bitset<32> bs(i);
        int hp = dp[i];
        int maxHp = 100;
        for(int j=0; j<n; ++j){
            if(bs[j] && d[j] < 0)
                maxHp += 100;
        }

        for(int j=0; j<n; ++j){
            if(bs[j])
                continue;
            bs[j] = true;
            dp[bs.to_ulong()] = max(dp[bs.to_ulong()], min(maxHp, hp + d[j]));
            bs[j] = false;
        }
    }
    cout << dp.back() << endl;

    return 0;
}