#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */

    int n; scanf("%d", &n);
    vector<int> d(n); for (int i = 0; i < n; i++) scanf("%d", &d[i]);
    vector<int> dp((1 << n), -inf); dp[0] = 100;

    for (int S = 0; S < (1 << n); S++) {
        int mx = 100;
        for (int i = 0; i < n; i++) if (S >> i & 1) if (d[i] < 0) mx += 100;
        for (int i = 0; i < n; i++) if (!(S >> i & 1)) {
            if (dp[S] + d[i] <= 0) continue;
            chmax(dp[S + (1 << i)], min(mx, dp[S] + d[i]));
        }
    }
    if (dp[(1 << n) - 1] < 0) puts("0");
    else cout << dp[(1 << n) - 1] << endl;
    return 0;
}