#include <bits/stdc++.h> using namespace std; #define int long long #define veci vector<int> #define pb push_back #define res resize #define fin for(int i=0;i<n;i++) cin >> a[i]; int32_t main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; veci a; a.res(n); fin veci b = a; sort(b.begin(), b.end()); int ans = 0; int i = 0; while(i<n){ int val = b[i]; veci idx; for(int k=0;k<n;k++){ if(a[k]==val) idx.pb(k); } int m = idx.size(); for(int x=0;x<m;x++){ for(int y=x;y<m;y++){ int L = idx[x]; int R = idx[y]; int len = R-L+1; int count_val = y-x+1; if(count_val*2 > len){ ans++; } } } while(i<n && b[i]==val) i++; } cout << ans; return 0; }