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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vi D;

void init(){
  cin >> N;
  D = vi( N );
  for( int i = 0; i < N; ++i )
    cin >> D[ i ];
}

vi dp;

void preprocess(){
  dp = vi( 1 << N, -INF );
  dp[ 0 ] = 100;
  for( int i = 0; i < 1 << N; ++i )
    if( dp[ i ] > 0 ){
      int max_hp = 100;
      for( int j = 0; j < N; ++j )
        if( i & 1 << j )
          if( D[ j ] < 0 )
            max_hp += 100;
      for( int j = 0; j < N; ++j )
        if( ~i & 1 << j ){
          if( D[ j ] < 0 ){
            if( dp[ i ] + D[ j ] > 0 )
              upmax( dp[ i | 1 << j ], dp[ i ] + D[ j ] );
          } else{
            upmax( dp[ i | 1 << j ], min( max_hp, dp[ i ] + D[ j ] ) );
          }
        }
    }
}

void solve(){
  if( dp[ ( 1 << N ) - 1 ] < 0 )
    cout << 0 << endl;
  else
    cout << dp[ ( 1 << N ) - 1 ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}