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

public class PairSum {
    static int start=0,end =0;
    static PrintStream p = System.out;
    static long largestValue(int[] A) {
        // Return the largest value of any of A's nonempty subarrays.
        maxSubArraySum(A,A.length);
        //p.println(start+" "+end);
        int sum=0;
        for(int i=start;i<=end;i++){
            for(int j=i+1;j<=end;j++){
                sum+=(A[i]*A[j]);
                //p.println(A[i]+" "+A[j]);
            }
        }
        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();
    }
    static void maxSubArraySum(int a[], int size)
    {
        int max_so_far = Integer.MIN_VALUE,
        max_ending_here = 0,s = 0;
 
        for (int i = 0; i < size; i++) 
        {
            max_ending_here += a[i];
 
            if (max_so_far < max_ending_here) 
            {
                max_so_far = max_ending_here;
                start = s;
                end = i;
            }
 
            if (max_ending_here < 0) 
            {
                max_ending_here = 0;
                s = i + 1;
            }
        }
        
        //System.out.println("Starting index " + start);
        //System.out.println("Ending index " + end);
    }
    
}