import java.util.Scanner;
 
public class shuzu {
 
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan=new Scanner(System.in);
        System.out.print("请输入数组中数字的个数:");
        int n=scan.nextInt();
        int[] a=new int [n];
        System.out.print("请输入数组:");
        for(int i=0;i<n;i++)
        {
           a[i]=scan.nextInt();
        }
        int a1=zuida(a,n);
        int b,temp,i,sum=0;
        for(b=1;b<n;b++)
        {
            temp=a[0];
            for(i=1;i<=n-1;i++)
            {
               a[i-1]=a[i];        
            }
            a[n-1]=temp;
            if(zuida(a,n)>=sum)
            {
             sum=zuida(a,n);
            }
        }
        int a2=sum;
        if(a1>=a2)
        {
            System.out.println("最大子数组和:" + a1);
        }
        else
        {
            System.out.println("最大子数组和:" + a2);
        }
 
             
    }
     public static int zuida(int a[],int n)
     {
         int sum=0;
          
            int b=0;
               
            for(int i=0; i<n; i++)
            {
                if(b<0)        
                    b=a[i];
                else
                    b+=a[i];
                if(sum<b)
                    sum=b;
            }
            return sum;
     }
}