import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long largestValue(int[] A) {
        // Return the largest value of any of A's nonempty subarrays.
        int max_so_far = A[0];
        int curr_max = A[0];
        int n=A.length;
        for (int i = 0; i < n; i++)
        {
               curr_max = Math.max(A[i], curr_max+A[i]);
            max_so_far = Math.max(max_so_far, curr_max);
        }
        return max_so_far;
    }
    
    

    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] A = new int[n];
        for(int A_i = 0; A_i < n; A_i++){
            A[A_i] = in.nextInt();
        }
        long result = largestValue(A);
        System.out.println(result);
        in.close();
    }
}