Problem Statement

There are $N$ monsters.
There are $2$ kinds of monsters.
The $2$ kinds are bad monsters and good monsters.
You must fight bad monsters $1$ time per $1$ monster.
Fighting reduces your HP and raises your level by $1$.
When your level goes up by 1, your maximum HP increases by $100$.
If your HP drops to $0$ or below, it ends there.
Good monsters restore your HP only $1$ time per $1$ monster.
However, the restored HP never exceeds your maximum HP.

Your initial HP is $100$ and your initial maximum HP is also $100$.
You want to defeat all the bad monsters.
You also want to have as much HP as possible remaining at the end.
You can encounter the monsters in any order.
How much HP can you have left at the end?
If your HP drops to $0$ or below along the way no matter what you do, the answer is $0$.

Note that you cannot defeat good monsters.

Input

$N$
$D_1\ D_2\ ... D_{N}$

$N$ is the total number of monsters. $1\le N \le 16$. ($N$ is a positive integer.)
$D_i$ is the information about the $i$-th monster.
If $D_i$ is positive, it is a good monster that restores |$D_i$| HP.
If $D_i$ is negative, it is a bad monster, and defeating it costs |$D_i$| HP.
$-1600 \le Di < 0、0 < Di \le 1600$. ($D_i$ is an integer other than $0$.)

Output

Output the maximum possible HP at the end on one line.
If your HP drops to 0 or below along the way no matter what you do, output 0 on one line.
Do not forget the newline at the end.

Sample

3
-90 50 50

110

4
-90 230 -120 120

240

4
-10 -300 100 100

0

4
-40 -60 210 -110

50