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 C# (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;

namespace id_0022cs
{
    class Program
    {
        static void Main(string[] args)
        {
            string line;
            while((line = Console.ReadLine()) != null)
            {
                var n = int.Parse(line);
                if (n == 0) { break; }
                List<int> vs = new List<int>();
                foreach (var x in Enumerable.Range(0, n))
                {
                    vs.Add(int.Parse(Console.ReadLine()));
                }
                int result = int.MinValue;
                foreach( var x in Enumerable.Range(0, n))
                {
                    foreach( var y in Enumerable.Range(1,n-x+1))
                    {
                        if (vs.Skip(x).Take(y).Sum() > result)
                        {
                            result = vs.Skip(x).Take(y).Sum();
                        }
                    }
                }
                Console.WriteLine(result);


            }
        }
    }
}