#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll trig (ll x) { return ((x * (x + 1)) >> 1); }
inline ll get2 (ll a, ll b, ll c) {
a = min(a, c); b = min(b, c);
c = min(c, a + b);
return (c - b) * (b + 1) + (c + 1) * (a - c + b + 1) - trig(a) + trig(c - b - 1);
}
const int MAXN = 2e5 + 25;
ll arr[MAXN], n;
vector <ll> occ[MAXN];
vector <int> d;
ll a[2 * MAXN + 25];
ll solve1 (int x) {
memset(a, 0, sizeof(a));
ll ret = 0; ll cur = 0; ll sum = 0; a[MAXN] = 1;
for (int i = 1; i <= n; i++) {
if (arr[i] == x) {
sum++; cur += a[sum - 1 + MAXN];
} else {
cur -= a[sum - 1 + MAXN]; sum--;
}
ret += cur; a[sum + MAXN]++;
}
return ret;
}
ll solve2 (ll x) {
ll ret = (ll)occ[x].size();
for (ll i = 0; i < (ll)occ[x].size() - 1; i--) {
for (ll j = i + 1; j < (ll)occ[x].size(); j++) {
ret += get2(occ[x][i] - (i == 0 ? 0 : occ[x][i - 1]), (j == (ll)occ[x].size() - 1 ? n + 1 : occ[x][j + 1]) - occ[x][j], 2 * (j - i + 1) - 2 - occ[x][j] + occ[x][i]);
}
}
return ret;
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
d.push_back(arr[i]);
}
sort(d.begin(), d.end()); d.resize(unique(d.begin(), d.end()) - d.begin());
for (int i = 1; i <= n; i++) arr[i] = lower_bound(d.begin(), d.end(), arr[i]) - d.begin();
for (int i = 1; i <= n; i++) {
occ[arr[i]].push_back(i);
}
ll sum = 0;
ll x = sqrt(n); while (x * x < n) x++; while (x * x > n) x--;
for (int i = 0; i < n; i++) {
if (occ[i].empty()) continue;
sum += solve1(i); continue;
if ((ll)occ[i].size() > x - 100) sum += solve1(i);
else {
sum += solve2(i);
}
}
cout << sum << '\n';
}
