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 Scala (judge verdict: Wrong Answer)

object Main extends App {
  val src = io.Source.stdin.getLines.map(_.toInt)

  val formattedSrc: List[List[Int]] = ((for (n <- src if n != 0) yield (src.take(n).toList)).toList)

  def transformList(li: List[Int]): IndexedSeq[List[Int]] =
    for { i <- 0 to li.length } yield { li.drop(i) }

  def findMax(li: IndexedSeq[List[Int]]) = (0 /: li)(returnBigger)

  def returnBigger(a: Int, b: List[Int]): Int = {
    val maxB = scanMax(b)
    if (a > maxB) a else maxB
  }

  def scanMax(li: List[Int]) = li.scanLeft(0)(_+_).max

  formattedSrc.map(a => findMax(transformList(a))).foreach(println)

}