#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <climits>
#include <random>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define F first
#define S second
#define all(v) v.begin(), v.end()
int n;
int a[200005];
void sub3(){
}
void sub12(){
ll ans = 0;
for(int l = 1; l <= n; l++){
ans += 1;
bool f = 1;
int sz = 1, d = a[l];
map<int, int> cnt;
++cnt[d];
for(int r = l + 1; r <= n; r++){
++cnt[a[r]];
if(a[r] == d) sz++;
else if(cnt[a[r]] > sz) sz = cnt[a[r]], d = a[r];
if(sz > (r - l + 1) / 2) f = 1;
else f = 0;
ans += f;
//cout << l << " " << r << " " << f << '\n';
}
}
cout << ans;
}
void solve(){
cin >> n;
bool s3 = 1;
for(int i = 1; i <= n; i++){
cin >> a[i];
s3 &= (a[i] <= 2);
}
sub12();
/*
if(s3) sub3();
else sub12();
*/
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int xach = 1;
//cin >> xach;
while(xach--) solve();
}
