//largest sum subarray - kadane's algorithm
import java.util.*;
import java.io.*;
public class Main{
    public static void main(String []args)throws IOException{
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int a[]=new int[n];
        for(int i=0;i<n;i++)
        {
            a[i]=sc.nextInt();
        }
        int maxsum=a[0],cursum=a[0];
        for(int i=1;i<n;i++)
        {
            cursum=Math.max(a[i],a[i]+cursum);
            maxsum=Math.max(maxsum,cursum);
        }
        System.out.println(maxsum);
    }
}