#include <cstdio> 
#include <chrono> 
#include <random> 

using namespace std;

typedef long long ll; 

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); 

const int N = 1e6 + 10;

int n, A[N];
int R[N], P[N]; 

int main() {
	for(int i = 1; i < N; ++i) {
		R[i] = rng();
		P[i] = P[i - 1] ^ R[i];
	}

	scanf("%d", &n); 
	ll ans = 0;
	for(int i = 0; i < n; ++i) {
		scanf("%d", A + i); 
		int res = 0;
		for(int j = i; j >= 0; --j) {
			res ^= R[A[j]];
			ans += (res == P[i - j + 1]);
		}
	}
	printf("%lld\n", ans);
	return 0;
}