#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 1e6 + 10, B1 = 31337, B2 = 137, mod1 = 1e9 + 7, mod2 = 1e9 + 9;

int n;
ll ans = 0;
int arr[maxn];
int maks[maxn];
int h1[maxn];
int h2[maxn];
//map <pair<int, int>, int> l;
//map <pair<int, int>, int> r;
int pref1[maxn];
int pref2[maxn];
int pot1[maxn];
int pot2[maxn];

int add1(int a, int b){
	return (a + b) % mod1;
}

int mul1(int a, int b){
	return ((ll)a * b) % mod1;
}

int sub1(int a, int b){
	return (a - b + mod1) % mod1;
}

int add2(int a, int b){
	return (a + b) % mod2;
}

int mul2(int a, int b){
	return ((ll)a * b) % mod2;
}

int sub2(int a, int b){
	return (a - b + mod2) % mod2;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	pot1[0] = 1;
	pot2[0] = 1;	
	
	for(int i = 1; i < maxn; i++){
		pot1[i] = mul1(pot1[i - 1], B1);
		pot2[i] = mul2(pot2[i - 1], B2);
	}
	
	for(int i = 2; i < maxn; i++){
		pref1[i] = add1(pref1[i - 1], pot1[i]);
		pref2[i] = add2(pref2[i - 1], pot2[i]);
	}
	
	cin >> n;
	
	for(int i = 1; i <= n; i++){
		cin >> arr[i];
	}
	
	for(int i = 1; i <= n; i++){
		if(arr[i] != 1) continue;
		
//		cout << i << endl;
		
		ans++;
		maks[i] = 1;
		h1[i] = 0;
		h2[i] = 0;
//		l.clear();
//		r.clear();
//		l[{0, 0}] = 1;
//		r[{0, 0}] = 1;
		
		for(int j = i - 1; j >= 1; j--){
			if(arr[j] == 1) break;
			
			maks[j] = max(maks[j + 1], arr[j]);
			h1[j] = add1(h1[j + 1], pot1[arr[j]]);
			h2[j] = add2(h2[j + 1], pot2[arr[j]]);
//			l[{h1[j], h2[j]}]++;
		}
		
		for(int j = i + 1; j <= n; j++){
			if(arr[j] == 1) break;
			
			maks[j] = max(maks[j - 1], arr[j]);
			h1[j] = add1(h1[j - 1], pot1[arr[j]]);
			h2[j] = add2(h2[j - 1], pot2[arr[j]]);
//			r[{h1[j], h2[j]}]++;
			
			if(add1(h1[j - maks[j] + 1], h1[j]) == pref1[maks[j]] && add2(h2[j - maks[j] + 1], h2[j]) == pref2[maks[j]]) ans++;
//			cout << "r: " << j << "  +" << l[sub(pref[maks[j]], h[j])] << ' ' << sub(pref[maks[j]], h[j]) << endl;
		}
		
		for(int j = i - 1; j >= 1; j--){
			if(arr[j] == 1) break;
			
			if(add1(h1[j + maks[j] - 1], h1[j]) == pref1[maks[j]] && add2(h2[j + maks[j] - 1], h2[j]) == pref2[maks[j]]) ans++;			
//			cout << "l: " << j << "  +" << r[sub(pref[maks[j]], h[j])] << endl;
		}
	}
	
	cout << ans;
	
	return 0;
}