#include<bits/stdc++.h>
using namespace std;
long long n,a[1001],i,p,s,d,f,j;
vector<int> v[1001];
int main()
{
freopen("split.in","r",stdin);
freopen("split.out","w",stdout);
cin>>n;
for(i=0;i<n;i++){
    cin>>a[i];
    v[a[i]].push_back(i);
}
while(p<n){
    for(i=v[a[p]].size()-1;i>=0;i--){
        d=v[a[p]][i]-p+1;
        if(d%2==0) d=d/2-1;
        else d=d/2;
        for(j=0;j<=d;j++){
            if(a[p+j]!=a[v[a[p]][i]-j]){
                f=1;
                break;
            }
        }
        if(f==0){
            d=v[a[p]][i]-p+1;
            s=s+d*d;
            p=v[a[p]][i]+1;
            break;
        }
        f=0;
    }
}
cout<<s;

return 0;
}