#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    long long n,i;
    cin>>n;
    long long a[n];
    for(i=0;i<n;i++)
       cin>>a[i];
    long long dp[n];
    dp[0]=a[0];
    for(i=1;i<n;i++)
    {
        dp[i]=max(a[i],dp[i-1]+a[i]);
    }
    long long mx=0,mxindex;
    for(i=0;i<n;i++)
    {
        if(dp[i]>mx)
        {
            mx=dp[i];
            mxindex=i;
        }
    }
    i=mxindex;
    vector<long long>vec;
    while(1)
    {
        vec.push_back(a[i]);
       // cout<<a[i]<<" ";
        mx=mx-a[i];
        if(mx<=0||i<=0)
            break;
        i--;
    }
    reverse(vec.begin(),vec.end());
    vector<long long>vec2(vec.size());
    vec2[0]=vec[0];
    for(i=1;i<vec.size();i++)
    {
        vec2[i]=vec[i]+vec2[i-1];
        //cout<<vec2[i]<<" ";
    }
    long long ans=0,cal;
    cal=vec2[vec2.size()-1];
    for(i=0;i<vec.size();i++)
    {
       // cout<<cal<<" ";
        cal=cal-vec[i];
        ans=ans+(cal)*(vec[i]);
        //cout<<ans<<" ";
    }
    cout<<ans<<endl;
    return 0;
}