#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    vector<int> dp(1<<n, -INF<int>);
    vector<int> maxhp(1 << n);
    maxhp[0] = 100;
    dp[0] = 100;
    for (int i = 1; i < (1 << n); ++i) {
        for (int j = 0; j < n; ++j) {
            if(i & (1 << j)){
                maxhp[i] = maxhp[i ^ (1 << j)] + 100*(v[j] < 0);
                dp[i] = max(dp[i], min(maxhp[i], dp[i^(1<<j)]+v[j]));
                if(dp[i] <= 0) dp[i] = -INF<int>;
            }
        }
    }
    cout << (dp.back() == -INF<int> ? 0 : dp.back()) << "\n";
    return 0;
}