Maximum Sub-sequence Sum  

Bob needs money, and since he knows you are here, he decided to gamble
intelligently. The game is rather simple: each player gets a sequence
of integers. The players must determine, by using their mega-pocket
computers, which is the maximum sum value which can be computed with non
empty sub-sequences of consecutive numbers from the given sequence. The
winner is the one which gets first the right result.

Can you help Bob with a program to compute quickly the wanted sum,
particularly when the sequence is quite long ?


Input  
The input file contains sequences of numbers. Each number will have at
most 5 digits. There will be at most 10000 numbers in each sequence. Each
sequence starts on a new line and may continue on several subsequent
lines. Each sequence ends with the number -999999 (which is not part of
the sequence).

Output  
The maximum sub-sequence sum for each sequence must be written on the
standard output, on a different line. A simple example is illustrated
in the sample below.  For simplicity you can assume that the output fits
in a long integer.

Sample Input  
1 2 3 -999999
-5 -2 
2 
30 -999999
-8 -999999
-1 0 -2 -999999


Sample Output  
6
32
-8
0