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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12

const int MAX_N = 16;
int N;
int D[MAX_N];
int dp[1<<MAX_N];

int main()
{
  cin >> N;
  rep(i, N) cin >> D[i];

  rep(i, 1<<N) dp[i] = -INF;
  dp[0] = 100;

  rep(S, 1<<N){
    int mask = 1;
    rep(i, N) if( (S & 1 << i) && D[i] < 0) mask += 1;
    rep(i, N) if(!(S & 1 << i)){
      if(D[i] < 0 && dp[S] + D[i] > 0){
        maxup(dp[S | 1<<i], dp[S] + D[i]);
      }
      if(D[i] > 0){
        maxup(dp[S | 1<<i], dp[S] + D[i]);
        minup(dp[S | 1<<i], mask * 100);
      }
    }
  }

  cout << max(dp[(1<<N)-1], 0) << endl;

  return 0;
}