#include <bits/stdc++.h> #define int long long using namespace std; const long long N = 2e5 + 5; int a[N]; int fr[N]; void solve() { int n; cin >> n; int mx = 0; map<int, int> compress; for (int i = 0; i < n; i++) { cin >> a[i]; if (compress[a[i]] == 0) { mx++; compress[a[i]] = mx; } a[i] = compress[a[i]]; } int ans = 0; for (int i = 0; i < n; i++) { map<int, int> fr; multiset<int> s; for (int j = i; j < n; j++) { s.extract(fr[a[j]]); fr[a[j]]++; s.insert(fr[a[j]]); if (*s.rbegin() > (j - i + 1) / 2) { // cout << i + 1 << ' ' << j + 1 << endl; ans++; } } } cout << ans << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t = 1; // cin >> t; for (int i = 1; i <= t; i++) { // cout << "Case #" << i << ':' << ' '; solve(); cout << endl; } return 0; }