#include <iostream>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

vector<int> d, dp;

int main(void) {
  int n; scanf("%d", &n);
  d.resize(n);
  for(int i : range(n)) { scanf("%d", &d[i]); }
  dp.resize(1<<n);
  dp[0] = 100;
  for(int mask : range(1<<n)) {
    int maxHP = 100;
    for(int i : range(n)) {
      if((mask>>i & 1) && d[i] < 0) {
        maxHP += 100;
      }
    }
    for(int i : range(n)) {
      if(!(mask>>i & 1)) { continue; }
      int nmask = mask & ~(1<<i);
      if(dp[nmask] == 0) { continue; }
      int now = dp[nmask] + d[i];
      if(d[i] > 0) {
        dp[mask] = max(dp[mask], min(maxHP, now));
      } else {
        dp[mask] = max(dp[mask], max(0, now));
      }
    }
  }
  int res = dp[(1<<n)-1];
  printf("%d\n", res);
  return 0;
}