#include<iostream>

#include<cstdio>

#include<cstring>

#include<vector>

using namespace std;

typedef long long ll;

int const maxn=1e5+,maxm=1e4+;

int n,a[maxn];

ll s[maxn],cnt[maxm],f[maxn];

vector<int>v[maxm];

ll x(int i){return s[i]-;}

ll y(int i){return f[i-]+a[i]*(s[i]-)*(s[i]-);}

ll ans(int i,int j){return f[j-]+a[i]*(s[i]-s[j]+)*(s[i]-s[j]+);}

ll squ(ll x){return x*x;}

int main()

{

    scanf("%d\n",&n);

    for(int i=,j,k,t;i<=n;i++)

    {

        scanf("%d",&a[i]); s[i]=++cnt[a[i]];

        while((t=v[a[i]].size()-)> &&

           (x(i)-x(j=v[a[i]][t]))*(y(k=v[a[i]][t-])-y(j)) - (y(i)-y(j))*(x(k)-(x(j))) > )//别写成if

            v[a[i]].pop_back();

        v[a[i]].push_back(i);

        int l=,r=v[a[i]].size()-,res=;//res=0  //不取新加入的i

        while(l<=r)

        {

            int mid=((l+r)>>);

            if(ans(i,v[a[i]][mid])>ans(i,v[a[i]][mid-]))res=mid,l=mid+;

            else r=mid-;

        }

        f[i]=ans(i,v[a[i]][res]);

    }

    printf("%lld\n",f[n]);

    return ;

}