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

public class Solution {
     static int max_start=0,max_end=0;
    static void maxSubArraySum(int a[])
    {
        int size = a.length;
        int max_so_far = Integer.MIN_VALUE, max_ending_here = 0;
       
 int p=0;
        for (int i = 0; i < size; i++)
        {
            max_ending_here = max_ending_here + a[i];
            if (max_so_far < max_ending_here)
            {
                max_start=p;
                max_end=i;
                max_so_far = max_ending_here;
            }
            if (max_ending_here < 0)
            {
                p=i+1;
                max_ending_here = 0;
            }
        }
        
    }

    static long largestValue(int[] A) {
        maxSubArraySum(A);
        
         int value=0;
	        int sum=0;
	        for(int i=max_start;i<=max_end;i++)
	            value=value+A[i];
	        
	      for(int i=max_start;i<max_end;i++)
	      {
	          value=value-A[i];
	         
	          sum+=value*A[i];
	          
	      }
	        return sum;
       
    }

    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();
    }
}