#include <iostream>
#include <algorithm>
#include <sstream>
#include <vector>

using namespace std;

typedef vector<int> IntVec;

int main(int argc, char *argv[])
{
	int N;
	cin >> N;
	IntVec g, b;
	for (int i = 0; i < N; ++i) {
		int d;
		cin >> d;
		if (d > 0) {
			g.push_back(d);
		} else {
			b.push_back(-d);
		}
	}
	sort(g.begin(), g.end());
	sort(b.begin(), b.end());
	int hp = 100, hpm = 100;
	int i, j;
	while (b.size() > 0) {
		for (i = b.size() - 1; i >= 0; --i) {
			if (hp > b[i]) {
				break;
			}
		}
		if (i >= 0) {
			hp -= b[i];
			hpm += 100;
			b.erase(b.begin() + i);
		} else if (g.size() <= 0) {
			hp = 0;
			break;
		} else {
			int m = 1 << 30, xi = g.size() - 1, xj = -1;
			for (i = 0; i != g.size(); ++i) {
				int x = min(hp + g[i], hpm);
				int y = x + g[i] - hpm;
				for (j = b.size() - 1; j >= 0; --j) {
					if (x > b[j] && y < m) {
						m = y;
						xi = i;
						xj = j;
						break;
					}
				}
			}
			hp = min(hp + g[xi], hpm);
			g.erase(g.begin() + xi);
			if (xj >= 0) {
				hp -= b[xj];
				hpm += 100;
				b.erase(b.begin() + xj);
			}
		}
	}
	if (b.size() <= 0) {
		for (i = 0; i != g.size(); ++i) {
			hp = min(hp + g[i], hpm);
		}
	}
	cout << hp << endl;
	return 0;
}