#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <cassert>
#include <cmath>
#include <bitset>
using namespace std;

int n;
int d[18];
int dp[300000];
int hp[300000];

int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> d[i];

  hp[0] = 100;
  for (int s = 0; s < (1<<n); s++)
    for (int i = 0; i < n; i++)
      if (~s&(1<<i)) {
        if (d[i] < 0) hp[s|(1<<i)] = hp[s]+100;
        else hp[s|(1<<i)] = hp[s];
      }
  //for (int s = 0; s < (1<<n); s++) cout << "hp[" << bitset<4>(s) << "] = " << hp[s] << endl;
  
  //for (int s = 0; s < 300000; s++) dp[s] = -1;
  dp[0] = 100;
  for (int s = 0; s < (1<<n); s++) {
    if (dp[s] <= 0) continue;
    for (int i = 0; i < n; i++)
      if (~s&(1<<i)) {
        if (d[i] > 0) {
          int res = min(dp[s] + d[i], hp[s|(1<<i)]);
          dp[s|(1<<i)] = max(dp[s|(1<<i)], res);
        }
        else {
          int res = dp[s] + d[i];
          dp[s|(1<<i)] = max(dp[s|(1<<i)], res);
        }
      }
  }
  //for (int s = 0; s < (1<<n); s++) cout << "dp[" << bitset<4>(s) << "] = " << dp[s] << endl;
  //cout << (dp[(1<<n)-1] < 0 ? 0 : dp[(1<<n)-1]) << endl;
  cout << dp[(1<<n)-1] << endl;
}