#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
int a[N], Log[N], st[N][20], vis[N], n, nxt[N];
void getlog() {
  Log[1] = 0;
  for (int i = 2; i < N; i++) Log[i] = Log[i / 2] + 1;
  return;
}
void rmq() {
  for (int i = 1; (1 << i) <= n; i++)
    for (int j = 0; j + (1 << i) <= n; j++)
      st[j][i] = max(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
  return;
}
int query(int l, int r) {
  int k = Log[r - l + 1];
  return max(st[l][k], st[r - (1 << k) + 1][k]);
}
int main() {
  cin >> n;
  getlog();
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    st[i][0] = a[i];
  }
  rmq();
  int r = 0;
  for (int l = 0; l < n; vis[a[l++]] = false) {
    while (r < n && !vis[a[r]]) vis[a[r++]] = true;
    nxt[l] = r;
  }
  int k = 0;
  long long ans = 0;
  for (int l = 0; l < n; l++) {
    for (r = l; r < nxt[l]; r++) {
      if ((k = query(l, r)) == r - l + 1)
        ans++;
      else
        r = l + k - 2;
    }
  }
  cout << ans << endl;
  return 0;
}
