Problem:
Maximum Sum Sequence

Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.

Input

The input consists of multiple datasets. Each data set consists of:

n
a1
a2
.
.
an

You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.

The input end with a line consisting of a single 0.

Output

For each dataset, print the maximum sum in a line.

Sample Input

7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0

Output for the Sample Input

19
14
1001

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n;
        while ((n = Integer.parseInt(br.readLine()))!= 0) {
            int S [] = new int [n+1];
            for (int i=0; i<n; i++) {
                S[i] = Integer.parseInt(br.readLine());
            }
            System.out.println(Max(S));
        }
    }
    public static long Max(int S[]) {
        long max = S[0];
        long sum = S[0];
        for (int i=1; i < S.length; i++) {
            if (sum+S[i] >= S[i])  sum+=S[i];
            else sum=S[i];
            if (max<=sum) max = sum;
        }
        return max;
    }
}