#include <bits/stdc++.h>
using namespace std;
long long rr[] = {0, 1, 1, 1, 0, -1, -1, -1};
long long cc[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long mod = 1e9 + 7;
const long long N = 500050;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long values[N], A[N], hashes[N], cnt[N];
vector<deque<long long> > store(N);
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long test = 1;
  while (test--) {
    long long n;
    cin >> n;
    for (long long i = 1; i <= n; i++) {
      values[i] = rng();
    }
    map<long long, long long> freq;
    long long cur_idx = 0, ans = 0;
    freq[0]++;
    for (long long i = 1; i <= n; i++) {
      cin >> A[i];
      store[A[i]].push_back(i);
      if (store[A[i]].size() > 3) {
        long long prev_idx = store[A[i]].front();
        store[A[i]].pop_front();
        while (cur_idx < prev_idx) {
          freq[hashes[cur_idx]]--;
          cur_idx++;
        }
      }
      hashes[i] =
          hashes[i - 1] + values[A[i]] * ((cnt[A[i]] + 1) % 3 - cnt[A[i]]);
      cnt[A[i]] = (cnt[A[i]] + 1) % 3;
      ans += freq[hashes[i]]++;
    }
    cout << ans << '\n';
  }
  return 0;
}
