#include <bits/stdc++.h>
using namespace std;
int n, a[300010];
int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x;
}
struct node {
  int maxx, pos;
};
struct ST {
  int maxx[30][300010], pos[30][300010];
  void init() {
    for (int i = 1; i <= n; ++i) maxx[0][i] = a[i], pos[0][i] = i;
    for (int i = 1; i <= 30; ++i)
      for (int j = 1; j <= n - (1 << i) + 1; ++j) {
        if (maxx[i - 1][j] >= maxx[i - 1][j + (1 << i - 1)])
          maxx[i][j] = maxx[i - 1][j], pos[i][j] = pos[i - 1][j];
        else
          maxx[i][j] = maxx[i - 1][j + (1 << i - 1)],
          pos[i][j] = pos[i - 1][j + (1 << i - 1)];
      }
  }
  node query(int l, int r) {
    int x = log2(r - l + 1);
    if (maxx[x][l] >= maxx[x][r - (1 << x) + 1])
      return {maxx[x][l], pos[x][l]};
    else
      return {maxx[x][r - (1 << x) + 1], pos[x][r - (1 << x) + 1]};
  }
} st;
int c[300010], pos[300010], maxx[300010], ans;
void f(int l, int r) {
  if (l > r) return;
  if (l == r) return ans += (a[l] == 1), void();
  node x = st.query(l, r);
  int mi = x.pos, v = x.maxx;
  if (mi - l <= r - mi)
    for (register int ll = max(l, mi - v + 1), rr = ll + v - 1;
         ll <= mi && rr <= r; ++ll, ++rr)
      ans += (maxx[rr] < ll);
  else
    for (register int rr = min(r, mi + v - 1), ll = rr - v + 1;
         rr >= mi && ll >= l; --ll, --rr)
      ans += (maxx[rr] < ll);
  f(l, mi - 1), f(mi + 1, r);
}
int main() {
  cin >> n;
  for (register int i = 1; i <= n; ++i) a[i] = read();
  st.init();
  for (register int i = 1; i <= n; ++i) pos[i] = c[a[i]], c[a[i]] = i;
  for (register int i = 1; i <= n; ++i) maxx[i] = max(maxx[i - 1], pos[i]);
  f(1, n);
  printf("%d\n", ans);
  return 0;
}
