#include <bits/stdc++.h>
using namespace std;
int a[300005], pos[300005], L[300005];
long long s[300005];
int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
bool check(int l, int r) {
  if (L[r] > l) return false;
  if (s[r] - s[l - 1] != 1LL * (r - l + 1) * (r - l + 2) / 2) return false;
  return true;
}
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) a[i] = read(), s[i] = s[i - 1] + a[i];
  for (int i = 1; i <= n; i++) {
    L[i] = max(L[i - 1], pos[a[i]] + 1);
    pos[a[i]] = i;
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1) {
      ++ans;
      int mx = 1;
      for (int j = i - 1; j >= 1; j--) {
        if (a[j] == 1) break;
        mx = max(mx, a[j]);
        if (check(j, j + mx - 1)) ++ans;
      }
      mx = 1;
      for (int j = i + 1; j <= n; j++) {
        if (a[j] == 1) break;
        mx = max(mx, a[j]);
        if (check(j - mx + 1, j)) ++ans;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
