#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<int> D(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &D[i]);
		vector<int> dp(1 << N, -1);
		dp[0] = 100;
		rep(i, 1 << N) {
			int x = dp[i];
			if(x < 0) continue;
			int lv = 1;
			rep(j, N) if(i >> j & 1)
				lv += D[j] < 0;
			rep(j, N) if(~i >> j & 1) {
				if(D[j] > 0) {
					amax(dp[i | 1 << j], min(lv * 100, x + D[j]));
				} else {
					int y = x + D[j];
					if(y > 0)
						amax(dp[i | 1 << j], y);
				}
			}
		}
		int mask = 0;
		rep(i, N) if(D[i] < 0)
			mask |= 1 << i;
		int ans = 0;
		rep(i, 1 << N) if((i & mask) == mask)
			amax(ans, dp[i]);
		printf("%d\n", ans);
	}
	return 0;
}