#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue> 
#define ll long long
using namespace std;
int n;
int a[200010];
int ind[200010][2];
ll ans;
int main(){
    freopen("charger.in","r",stdin);
    freopen("charger.out","w",stdout);
    
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
    	int p=i+1,q=i-1;
    	for(;p<=n;p++) if(a[i]==a[p]) break;
    	for(;q>=1;q--) if(a[i]==a[q]) break;
    	ind[i][0]=p;
    	ind[i][1]=q;
	}
	for(int i=1;i<=n;i++) for(int j=i+1;j<ind[i][0];j++) if(ind[j][1]<i) ans++;
	printf("%lld",ans);
    
    return 0;
}