#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

ll dp[1<<16];
ll hp[1<<16];

int main(){
    
    int N; cin>>N;
    vector<int> D(N);
    REP(i,N)cin>>D[i];
    
    REP(i,(1<<16))dp[i]=hp[i]=-1e9;
    
    dp[(1<<N)-1]=100;
    hp[(1<<N)-1]=100;
    
    for (int i=((1<<N)-1); i>=0; i-- ){
        for (int j=0; j<N; j++ ) {
            int mask = (1<<j);
            int add = D[j];
            if( (i|mask) > i ) {
                if ( add>0 ) {
                    dp[i] = max(dp[i],min(dp[i|mask]+add,hp[i|mask]));
                    hp[i] = hp[i|mask];
                }else{
                    if ( dp[i|mask] + add>0 ) {
                        if ( hp[i|mask] + 100 > hp[i] ) {
                            dp[i] = dp[i|mask] + add;
                            hp[i] = hp[i|mask] + 100;
                        }
                    }
                }
            }
        }
    }
    
    cout<<dp[0]<<endl;
    
    return 0;
}