/* This Code is Submitted by icycandy for Problem 1760 on 2008-11-17 at 16:14:52 *//*changminqiang*/
/*Runid Proid Subtime Judgestatus Runtime Memory Language Code Length Author
303426 1760 2008-11-16 18:53:26 Accepted 0.10s  704 K C++  954 B changminqiang */
#include <stdio.h>
#include <stdlib.h>
/*函數(shù)功能：找最大子序列
  入口參數(shù)：數(shù)列a和輸入數(shù)字個數(shù)n
  返回值：最大子列的值*/
int MaxSubsequenceSum(int A[], int N)
{
    int ThisSum, MaxSum, j;
    ThisSum = MaxSum = 0;
    for(j=0; j < N; j++)
{
        ThisSum += A[j];
        if (ThisSum > MaxSum)
        MaxSum = ThisSum;
        else if(ThisSum < 0)
        ThisSum = 0;
}
return MaxSum;
}
int main()
{
    int n=-1,i,m;
    int *p=NULL;
    while(n!=0)               /*循環(huán)控制*/
    {
        scanf("%d",&n);
        if(n==0)
        continue;
        else
        p=(int*)malloc(n*sizeof(int));        /*申請動態(tài)數(shù)組*/
        if(p==NULL)                           /*判斷書否成功*/
        {
            exit(0);
        }
        for(i=0;i<n;i++)
        {
            scanf("%d",p+i);
        }
        m=MaxSubsequenceSum(p,n);              /*調(diào)用函數(shù)*/
        if(m>0)
        printf("The maximum winning streak is %d.\n",m);
        else
        printf("Losing streak.\n");
        free(p);                               /*釋放內(nèi)存*/
    }
    return 0;
}