// Wrongri-La Shower

#include <cstdio>
#include <queue>
#include <tuple>

typedef std::tuple<int,int> P;

int N;
int D[16];
int jobutu[1<<16], d[1<<16];

int main(){
    scanf("%d", &N);

    for(int i=0;i<N;i++){
        scanf("%d", &D[i]);
    }

    for(int i=0;i<1<<N;i++){
        for(int j=0;j<N;j++){
            if(!(i >> j & 1)){continue;}
            jobutu[i] += D[j] < 0;
        }
    }

    std::priority_queue<P> queue;
    d[0] = 100;
    queue.push(std::make_tuple(d[0], 0));

    while(!queue.empty()){
        P p = queue.top(); queue.pop();
        int health, finished;
        std::tie(health, finished) = p;
        
        for(int i=0;i<N;i++){
            if(finished >> i & 1){continue;}

            int newHealth = std::min(health+D[i], (jobutu[finished]+1) * 100),
                newFinished = finished | (1<<i);
            
            if(d[newFinished] >= newHealth){continue;}
            d[newFinished] = newHealth;
            queue.push(std::make_tuple(d[newFinished], newFinished));
        }
    }

    printf("%d\n", d[(1<<N)-1]);
}