#include <bits/stdc++.h>
using namespace std;
int n,a[200010],b[2010][2010],mk[200010],mk1[200010],res;
int main () {
    freopen("charger.in","r",stdin);
    freopen("charger.out","w",stdout);
    cin >> n;
    int sum=0;
    for (int i=1;i<=n;i++) {
        cin >> a[i];
        b[i][a[i]]++;
        if (mk[a[i]]==0) {
            sum++;
            mk[a[i]]=1;
        }
    }
    if (sum==n) {
        cout << n*(n-1)/2 <<endl;
        return 0;
    }
    for (int i=1;i<=n;i++) {
        if (mk1[a[i]]==1) continue; 
        for (int j=1;j<=n;j++) {
            b[j][a[i]]+=b[j-1][a[i]];
            //cout << b[i][a[j]] <<' '<< a[j] <<endl;
        }
        mk1[a[i]]=1;
    }
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=n;j++) {
            //if (b[i][j]==0) b[i][j]=1;
        }
    }
    for (int i=1;i<=n;i++) {
        for (int j=i+1;j<=n;j++) {
            //cout << i << j << a[i] << a[j];
            //cout << b[i][a[i]] <<' '<< b[j][a[i]] <<' '<< b[i][a[j]] <<' '<< b[j][a[j]] <<endl;
            if (a[i]!=a[j]&&b[i][a[i]]==b[j-1][a[i]]&&b[i][a[j]]==b[j-1][a[j]]) res++;
        }
    }
    cout << res <<endl;
    return 0; 
}