#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
//0-indexed,2冪のセグメントツリー
template <class T>
struct SegTree {
    private:
    int n;// 葉の数
    vector<T> data;// データを格納するvector
    T def; // 初期値かつ単位元
    function<T(T, T)> operation; // 区間クエリで使う処理
    function<T(T, T)> change;// 点更新で使う処理

    T find(int a, int b) {
        T val_left = def, val_right = def;
        for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1)
        {
            if ((a & 1) == 0){
                val_left = operation(val_left, data[a]);
            }
            if ((b & 1) == 0){
                val_right = operation(data[--b],val_right);
            }
        }
        return operation(val_left, val_right);
    }
    public:
    // _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
    // _change:更新関数
    SegTree(size_t _n, T _def, function<T(T, T)> _operation,
        function<T(T, T)> _change=[](T a,T b){return b;})
        : def(_def), operation(_operation), change(_change) {
        n = 1;
        while (n < _n) {
            n *= 2;
        }
        data = vector<T>(2 * n - 1, def);
    }
    void set(int i, T x) { data[i + n - 1] = x; }
    void build() {
        for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]);
    }
    // 場所i(0-indexed)の値をxで更新
    void update(int i, T x) {
        i += n - 1;
        data[i] = change(data[i], x);
        while (i > 0) {
            i = (i - 1) / 2;
            data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }
    T all_prod(){
      return data[0];
    }
    // [a, b)の区間クエリを実行
    T query(int a, int b) {
        //return _query(a, b, 0, 0, n);
        return find(a,b);
    }

    // 添字でアクセス
    T operator[](int i) {
        return data[i + n - 1];
    }
};
int main(){
  ll n;cin >> n;
  vl a(n);rep(i,n)cin >> a[i];
  ll base=300;
  map<ll,vl> mp;
  rep(i,n){
    mp[a[i]].emplace_back(i);
  }
  ll ans=0;
  for(auto [hoge,v]:mp){
    if(v.size()>=base){
      SegTree<ll> st(n*2+10,0,[](ll a,ll b){return a+b;},[](ll a,ll b){return a+b;});
      ll base=n+5;
      vl cs(n+1,-1);cs[0]=0;
      for(auto p:v)cs[p+1]=1;
      rep(i,n)cs[i+1]+=cs[i];
      rep(i,n+1){
        ans+=st.query(0,base+cs[i]);
        st.update(base+cs[i],1);
      }
    }
    else{
      rep(i,v.size()){
        repl(j,i,v.size()){
          ll f=(j-i+1)*2-(v[j]-v[i]+1);
          //cout << f << endl;
          if(f<=0)continue;
          for(ll left=v[i];left>=0;left--){
            
            if(i&&v[i-1]==left)break;
            ll now=f-(v[i]-left);
            if(now<=0)break;
            for(ll right=v[j];right<n;right++){
              if(j+1<v.size()&&v[j+1]==right)break;
              /*if(hoge==1){
                cout << f <<" " << left << endl;
                cout << now << endl;
              }*/
              ans++;
              now--;
              if(now<=0)break;
            }
          }
        }
      }
      //cout << ans << endl;
    }
  }
  cout << ans << endl;
}