#include <bits/stdc++.h>
using namespace std;

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  vt<int> d(n);
  rep(i, 0, n) cin >> d[i];

  vt<int> maxHP(1 << n, 100);
  rep(bit, 0, (1 << n)) {
    rep(i, 0, n) {
      if(bit & (1 << i) && d[i] < 0) maxHP[bit] += 100;
    }
  }

  vt<int> dp(1 << n, -1);
  dp[0] = 100;
  rep(bit, 0, (1 << n)) {
    rep(i, 0, n) {
      if(bit & (1 << i)) continue;

      if(dp[bit] + d[i] <= 0 || dp[bit] == -1) dp[bit | (1 << i)] = max(dp[bit | (1 << i)], -1);
      else dp[bit | (1 << i)] = max(dp[bit | (1 << i)], min(dp[bit] + d[i], maxHP[bit]));
    }
  }

  if(dp[(1 << n) - 1] == -1) cout << 0 << endl;
  else cout << dp[(1 << n) - 1] << endl;
}