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

int main(){
    int n;
    cin>>n;
    vector<int> dp(1<<n,0);
    dp[0] = 100;
    vector<int> d(n);
    for(int i = 0;i<n;i++) cin>>d[i];
    for(int i = 0;i<1<<n;i++){
        if(dp[i]==0) continue;
        int mx = 100;
        for(int j = 0;j<n;j++) if(i>>j&1) if(d[j]<0) mx += 100;
        for(int j = 0;j<n;j++) if(~i>>j&1){
            if(d[j]<0){
                int nxt = dp[i] + d[j];
                if(nxt<=0) continue;
                dp[i|1<<j] = max(dp[i|1<<j],nxt);
            }else{
                int nxt = dp[i] + d[j];
                nxt = min(nxt,mx);
                dp[i|1<<j] = max(dp[i|1<<j],nxt);
            }
        }
    }
    cout<<dp.back()<<endl;
}