#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

ll solve(vi& a, int l, int r) {
  if (l + 1 == r) return 1;

  int m = (l + r) / 2;
  int res = solve(a, l, m) + solve(a, m, r);
  set<int> xs;
  map<int, int> mp;
  int ma = 0;
  for (int i = m - 1; i >= l; i--) {
    mp[a[i]]++;
    if (mp[a[i]] > ma) {
      ma = mp[a[i]];
      xs.insert(a[i]);
    }
  }
  mp.clear();
  ma = 0;
  for (int i = m; i < r; i++) {
    mp[a[i]]++;
    if (mp[a[i]] > ma) {
      ma = mp[a[i]];
      xs.insert(a[i]);
    }
  }

  for (auto itr = xs.begin(); itr != xs.end(); itr++) {
    int x = *itr;
    vi left, right;
    int now = 0;
    for (int i = m - 1; i >= l; i--) {
      if (a[i] == x) now++;
      else now--;
      left.push_back(now);
    }
    now = 0;
    for (int i = m; i < r; i++) {
      if (a[i] == x) now++;
      else now--;
      right.push_back(now);
    }
    sort(all(left));
    sort(all(right));
    int ri = right.size() - 1;
    rep (li, left.size()) {
      while (ri >= 0 and left[li] + right[ri] > 0) {
        ri--;
      }
      res += right.size() - ri - 1;
    }
  }
  return res;
}

signed main() {
  int n;
  cin >> n;
  vi a(n);
  rep (i, n) {
    cin >> a[i];
  }

  ll ans = solve(a, 0, n);
  cout << ans << endl;
}