#include <iostream>
#include <vector>
using namespace std;
int dp[17][(1<<17)][17];

int main(){
  int n;cin>>n;
  vector<int> X(n);
  int evilm = 0;
  for(int i = 0; n > i; i++){
    cin>>X[i];
    if(X[i] < 0)evilm++;
  }
  dp[0][0][0] = 100;
  for(int z = 0; n > z; z++){
    for(int i = 0; (1<<n) > i; i++){
      for(int j = 0; n > j; j++){
        if(i & (1<<j))continue;
        for(int k = 0; n > k; k++){
          if(dp[z][i][k] <= 0)continue;
          if(X[j] > 0){
            dp[z+1][i+(1<<j)][k] = min((k+1)*100,max(dp[z+1][i+(1<<j)][k],dp[z][i][k]+X[j]));
          }else{
            if(dp[z][i][k]+X[j] > 0)dp[z+1][i+(1<<j)][k+1] = max(dp[z+1][i+(1<<j)][k+1],dp[z][i][k]+X[j]);
          }
        }
      }
    }
  }
  // for(int i = 0; n > i; i++){
  //   for(int j = 0; (1<<n) > j; j++){
  //     for(int k = 0; n > k; k++){
  //       cout << "(" << i << "," << j << "," << k << "):" << dp[i][j][k] << " ";
  //     }
  //   }
  //   cout << endl;
  // }
  cout << dp[n][(1<<n)-1][evilm] << endl;
}