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: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

		while (input.ready()) {
			int setCount = Integer.valueOf(input.readLine());
			if (setCount == 0)
				break;
			ArrayList<Integer> dataSet = new ArrayList<>();
			for (int i = 0; i < setCount; i++) {
				dataSet.add(Integer.valueOf(input.readLine()));
			}
			ArrayList<Integer> ansSet = new ArrayList<>();
			for (int i = 0; i < setCount; i++) {
				int tmp = 0;
				for (int j = i; j < setCount; j++) {
					tmp += dataSet.get(j);
					ansSet.add(tmp);
				}
			}
			Collections.sort(ansSet);
			System.out.println(ansSet.get(ansSet.size()-1));
		}
	}
}