#include <cstdio> 
#include <chrono> 
#include <random> 
#include <cstring> 
#include <algorithm>

using namespace std;

typedef long long ll; 

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

const int N = 1e6 + 10;
const int OG = 5000;

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

int U[N], S[N], I[N]; 
int trazi(int u) { return U[u] == -1 ? u : U[u] = trazi(U[u]); } 
void unija(int u, int v) {
	u = trazi(u); 
	v = trazi(v); 
	if(S[u] < S[v]) swap(u, v); 
	U[v] = u;
	S[u] += S[v];
}

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); 
		I[i] = i;
		if(n > OG) continue;
		int res = 0;
		for(int j = i; j >= 0; --j) {
			res ^= R[A[j]];
			ans += (res == P[i - j + 1]);
		}
	}

	if(n <= OG) {
		printf("%lld\n", ans);
		return 0;
	}

	memset(U, -1, sizeof(U));
	sort(I, I + n, [](int a, int b) { return A[a] < A[b]; });
	for(int i = 0; i < n; ++i) {
		int ind = I[i]; 
		S[ind] = 1;
		if(ind != 0 && S[trazi(ind - 1)] > 0) unija(ind - 1, ind);
		if(ind != n - 1 && S[trazi(ind + 1)] > 0) unija(ind, ind + 1); 
		ans += S[trazi(ind)] == i + 1;
	}
	printf("%lld\n", ans);
	return 0;
}