#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
template <typename T>
T gcd(T a, T b) {
  return (b ? __gcd(a, b) : a);
}
template <typename T>
T lcm(T a, T b) {
  return (a * b) / gcd(a, b);
}
mt19937 rnd(42);
const int K = 60;
array<int, K> operator^(const array<int, K> &a, const array<int, K> &b) {
  array<int, K> c;
  for (int i = 0; i < (K); ++i) {
    c[i] = a[i] + b[i];
    c[i] %= 3;
  }
  return c;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) {
    cin >> a[i];
    a[i]--;
  }
  vector<array<int, K> > rands(n);
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (K); ++j) rands[i][j] = rand() % 3;
  map<array<int, K>, int> cnt;
  vector<array<int, K> > xors(1);
  cnt[xors.back()] = 1;
  int curr = 0;
  vector<vector<int> > pos(n);
  long long int ans = 0;
  for (int i = 0; i < (n); ++i) {
    xors.push_back(xors.back() ^ rands[a[i]]);
    pos[a[i]].push_back(i);
    int len = int((pos[a[i]]).size());
    if (len >= 4) {
      while (curr <= pos[a[i]][len - 4]) {
        --cnt[xors[curr]];
        curr++;
      }
    }
    ans += cnt[xors.back()];
    cnt[xors.back()]++;
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
