#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<math.h>
#include<set>
#include<cstdio>
#include<string>
#include<queue>
#include<complex>
#include<numeric>
#include<stack>
#include<unordered_map>
#include<map>
#include <cassert>
#include<random>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define req(i,n) for(ll i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i--)
#define ALL(a) a.begin(),a.end()
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; }
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
const ll MOD = 998244353;
int main() {
    int n; cin >> n; vector<int> d(n),dp(1<<n,0);
    rep(i, n) cin >> d[i];
    dp[0] = 100;
    rep(bit, 1 << n) {
        int cnt = 1;
        if (dp[bit] == 0)continue;
        rep(i, n) if (((bit >> i) & 1)&&(d[i]<0))cnt++;
        rep(i, n) {
            if (!((bit >> i) & 1)) {
                if (dp[bit] + d[i] <= 0)continue;
                chmax(dp[bit | (1 << i)], min(dp[bit] + d[i],cnt*100));
            }
        }
    }cout << dp[(1 << n) - 1] << endl;
}