#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 100;
int n, a[N], ans;
mt19937 rnd(1);
unsigned long long val[N], Xor[N], sum[N];
bool check(int l, int r) {
  if (l < 0 || r > n || l > r) return 0;
  return !(sum[r] ^ sum[l - 1] ^ Xor[r - l + 1]);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i], val[i] = rnd();
  for (int i = 1; i <= n; ++i) Xor[i] = Xor[i - 1] ^ val[i];
  for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] ^ val[a[i]];
  for (int i = 1; i <= n; ++i)
    if (a[i] == 1) {
      int l = i, r = i, mxl = 0, mxr = 0;
      ++ans;
      while (l > 1 && a[l - 1] != 1)
        mxl = max(mxl, a[--l]), ans += check(l, l + mxl - 1);
      while (r < n && a[r + 1] != 1)
        mxr = max(mxr, a[++r]), ans += check(r - mxr + 1, r);
    }
  cout << ans << endl;
  return 0;
}
