#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long answer = 0;
  vector<int> p(n);
  vector<int> most_DR(n);
  for (int i = 0; i < n; ++i) cin >> p[i];
  vector<int> NexDr(n, n + 1), Last(n + 1, n + 1), NexSt(n, -1);
  for (int i = n - 1; i >= 0; --i) {
    NexDr[i] = Last[p[i]];
    Last[p[i]] = i;
  }
  Last = vector<int>(n + 1, -1);
  for (int i = 0; i < n; ++i) {
    NexSt[i] = Last[p[i]];
    Last[p[i]] = i;
  }
  int distincte = 0;
  vector<int> Vaz(n + 1);
  auto Add = [&](int x) {
    if (!Vaz[x]) {
      ++distincte;
    }
    Vaz[x]++;
  };
  auto Del = [&](int x) {
    Vaz[x]--;
    if (!Vaz[x]) --distincte;
  };
  for (int i = n - 1, j = n - 1; i >= 0; --i) {
    Add(p[i]);
    while (j > i && j - i + 1 != distincte) Del(p[j]), j--;
    most_DR[i] = j;
  }
  vector<int> most_ST(n, -1);
  distincte = 0;
  Vaz = vector<int>(n + 1, 0);
  for (int i = 0, j = 0; i < n; ++i) {
    Add(p[i]);
    while (j < i && i - j + 1 != distincte) Del(p[j]), j++;
    most_ST[i] = j;
  }
  vector<int> lf(n), rg(n);
  stack<pair<int, int> > s;
  s.push(make_pair(n + 1, -1));
  for (int i = 0; i < n; i++) {
    while (s.top().first < p[i]) s.pop();
    lf[i] = s.top().second;
    s.push(make_pair(p[i], i));
  }
  while (!s.empty()) s.pop();
  s.push(make_pair(n + 1, n));
  for (int i = n - 1; i >= 0; i--) {
    while (s.top().first < p[i]) s.pop();
    rg[i] = s.top().second;
    s.push(make_pair(p[i], i));
  }
  for (int i = 0; i < n; ++i) {
    int mnAp = (int)1e9;
    if (i - lf[i] < rg[i] - i) {
      for (int j = i; j > lf[i]; --j) {
        mnAp = min(mnAp, NexDr[j]);
        int go_to = j + p[i] - 1;
        if (go_to >= n) continue;
        if (go_to >= rg[i]) continue;
        if (mnAp <= go_to) continue;
        if (go_to > most_DR[i]) continue;
        answer++;
      }
    } else {
      int mxAp = -2;
      for (int j = i; j < rg[i]; ++j) {
        mxAp = max(mxAp, NexSt[j]);
        int go_to = j - p[i] + 1;
        if (go_to < 0) continue;
        if (go_to <= lf[i]) continue;
        if (mxAp >= go_to) continue;
        if (go_to < most_ST[i]) continue;
        ++answer;
      }
    }
  }
  cout << answer;
}
