#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

#define ll long long

#define N 100010

char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}

int gcd(int n,int m){return m==?n:gcd(m,n%m);}

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

int n,m,a[N],b[N],cnt[N],p[N],pre[N];

ll f[N];

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj4709.in","r",stdin);

    freopen("bzoj4709.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read();

    for (int i=;i<=n;i++) a[i]=read();

    for (int i=;i<=n;i++)

    {

        int t=i;

        while (t<n&&a[t+]==a[i]) t++;

        m++,b[m]=a[i],cnt[m]=t-i+,pre[m]=p[a[i]],p[a[i]]=m;

        i=t;

    }

    for (int i=;i<=m;i++)

    {

        int s=;

        for (int j=i;j;j=pre[j])

        {

            s+=cnt[j];

            f[i]=max(f[i],f[j-]+1ll*b[i]*s*s);

        }

    }

    cout<<f[m];

    return ;

}