#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
inline void chkmax(A &x, const B y) {
  if (x < y) x = y;
}
template <typename A, typename B>
inline void chkmin(A &x, const B y) {
  if (x > y) x = y;
}
const int N = 3e5 + 5;
int n;
int a[N], mx[N][20], lg[N];
void init() {
  for (int j = 1; (1 << j) <= n; j++)
    for (int i = 1; i + (1 << j) - 1 <= n; i++)
      mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
}
int query(int l, int r) {
  int k = lg[r - l + 1];
  return max(mx[l][k], mx[r - (1 << k) + 1][k]);
}
int R[N], lst[N];
int main() {
  scanf("%d", &n);
  for (int i = (2), iR = (n); i <= iR; i++) lg[i] = lg[i >> 1] + 1;
  for (int i = (1), iR = (n); i <= iR; i++) {
    scanf("%d", &a[i]);
    mx[i][0] = a[i];
  }
  init();
  R[n + 1] = n;
  for (int i = (n), iL = (1); i >= iL; i--) {
    if (lst[a[i]])
      R[i] = min(R[i + 1], lst[a[i]] - 1);
    else
      R[i] = R[i + 1];
    lst[a[i]] = i;
  }
  int ans = 0;
  for (int i = (1), iR = (n); i <= iR; i++) {
    int j = i;
    while (j <= R[i]) {
      int Mx = query(i, j);
      if (Mx == j - i + 1) {
        ans++;
        j++;
      } else
        j = i + Mx - 1;
    }
  }
  printf("%d\n", ans);
  return 0;
}
