#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
#define mp make_pair
#define vec vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
struct fen {
vector <int> t;
int norm;
fen (int n = 0) : norm(n >> 1), t(n + 100) {}
inline void upd (int i, int x) { for (i += norm; i < sz(t); i += (i & -i)) t[i] += x; }
inline int get (int i) { int res = 0; for (i += norm; i; i -= (i & -i)) res += t[i]; return res; }
inline int get (int l, int r) { return get(r) - get(l - 1); }
};
inline void solve () {
int n; cin >> n;
vector <int> a (n + 1);
for (int i = 1; i <= n; ++i) cin >> a[i], --a[i];
map <int, vector <int>> mp;
for (int i = 1; i <= n; ++i) mp[a[i]].pb(i);
const int N = n * 4 + 100;
const int B = 1800;
ll ans = 0;
function <ll(ll, ll, ll)> ff = [&] (ll L, ll R, ll k) {
umin(L, k); umin(R, k);
assert(L <= 10);
ll rett = 0;
for (int xs = 0; xs <= L; ++xs) rett += min(R, k - xs) + 1;
return rett;
};
for (auto &[_, pos] : mp) {
if (sz(pos) > B) {
vector <int> c (n + 1);
fen t (N); t.upd(0, 1);
for (int i = 1; i <= n; ++i) c[i] = c[i - 1] + (a[i] == _ ? +1 : 0);
for (int i = 1; i <= n; ++i) {
ans += t.get(2 * c[i] - i - 1);
t.upd(2 * c[i] - i, 1);
}
}
else {
for (int i = 0; i < sz(pos); ++i) {
for (int j = i; j < sz(pos); ++j) {
int c = j - i + 1;
int len = pos[j] - pos[i] + 1;
int k = 2 * c - len - 1;
int L = (i ? pos[i] - pos[i - 1] - 1 : pos[i] - 1);
int R = (j + 1 < sz(pos) ? pos[j + 1] - pos[j] - 1 : n - pos[j]);
ans += ff(L, R, k);
}
}
}
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1; // cin >> t;
while (t--) solve();
return 0;
}
