#include <iostream>
#include <algorithm>
using namespace std;
int n,d[15],dp[1<<15];
int main(void){
    cin>>n;
    for(int i=0;i<n;i++)cin>>d[i];
    for(int i=0;i<1<<n;i++)dp[i]=-25600;
    dp[0]=100;
    for(int k=0;k<1<<n;k++){
        int s=100;
        for(int i=0;i<n;i++)if((k>>i&1)&&d[i]<0)s+=100;
        for(int i=0;i<n;i++){
            if(!(k>>i&1)){
                dp[k|1<<i]=max(dp[k|1<<i],min(dp[k]+d[i],s));
            }
        }
    }
    cout<<max(dp[(1<<n)-1],0)<<endl;
}