#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#include <algorithm>
using namespace std;
#define INF (int)1e8;

int main()
{
	bool flag = true;
	int HP = 100, maxHP = 100;
	int n; cin >> n;
	vector<int>enemy,angel;
	for (int i = 0; i < n; i++) {
		int d; cin >> d;
		if (d < 0)enemy.push_back(-d);
		else angel.push_back(d);
	}

	sort(angel.begin(), angel.end());
	sort(enemy.begin(), enemy.end());
	while (angel.size() + enemy.size()) {
		vector<pair<int, vector<int>>>P;
		for (int i = enemy.size()-1; i >= 0; i--) {
			int hp = HP;

			vector<int>x;
			for (int j = i; j >= 0;j--) {
				if (hp - enemy[j] <= 0)continue;
				hp -= enemy[j];
				x.push_back(j);
			}
			if(x.size())P.push_back(make_pair(maxHP + 100 * x.size() - hp, x));
		}

		if (P.size() == 0){
			if (angel.size()) {
				HP = maxHP;
				angel.erase(angel.begin());
			}
			for (int i = enemy.size() - 1; i >= 0; i--) {
				int hp = HP;
				vector<int>x;
				for (int j = i; j>=0; j--) {
					if (hp - enemy[j] <= 0)continue;
					hp -= enemy[j];
					x.push_back(j);
				}
				if(x.size())P.push_back(make_pair(maxHP + 100 * x.size() - hp, x));
			}
			if (P.size() == 0) {
				flag = false;
				break;
			}
		}
		sort(P.begin(), P.end(),greater<pair<int,vector<int>>>());
		for (int i = 0; i < P[0].second.size(); i++) {
			enemy.erase(enemy.begin()+P[0].second[i]);
		}

		maxHP += P[0].second.size() * 100;
		HP = maxHP-P[0].first;
		//cout << HP << endl;
		if (angel.size() == 0)break;
		vector<pair<int, vector<int>>>Q;
		for (int i = angel.size() - 1; i >= 0; i--) {
			int hp = maxHP-HP;
			vector<int>x;
			for (int j = i; j>= 0; j--) {
				if (hp - angel[j] < 0)continue;
				hp -= angel[j];
				x.push_back(j);
			}
			if(x.size())Q.push_back(make_pair(hp, x));
		}


		if (Q.size() == 0) {
			HP = maxHP;
			angel.erase(angel.begin());
		}
		else {
			sort(Q.begin(), Q.end());
			for (int i = 0; i < Q[0].second.size(); i++) {
				angel.erase(angel.begin() + Q[0].second[i]);
			}
			HP = maxHP-Q[0].first;
		}

	}

	if (flag && enemy.size()==0)cout << HP << endl;
	else cout << 0 << endl;

    return 0;
}