/* -*- coding: utf-8 -*-
 *
 * 107.cc: No.107 モンスター - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 16;
const int NBITS = 1 << MAX_N;

/* typedef */

/* global variables */

int ds[MAX_N];
int dp[NBITS], mhs[NBITS];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> ds[i];

  int nbits = 1 << n;

  for (int bits = 0; bits < nbits; bits++) {
    int cnt = 1;
    for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
      if ((bits & bi) && ds[i] < 0) cnt++;
    mhs[bits] = cnt * 100;
  }

  dp[0] = 100;

  for (int bits = 0; bits < nbits; bits++) {
    if (dp[bits] == 0) continue;

    for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
      if (! (bits & bi)) {
	int bits0 = bits | bi;
	int d = min(dp[bits] + ds[i], mhs[bits]);
	if (dp[bits0] < d) dp[bits0] = d;
      }
  }

  printf("%d\n", dp[nbits - 1]);
  return 0;
}