#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
const size_t MAX_N = 3e5;
ull N;
int val[MAX_N + 1];
ull permHashes[MAX_N + 1];
ull inpHashes[MAX_N + 1];
int inp[MAX_N + 1];
inline ull hashRange(int i, int j) { return inpHashes[i - 1] ^ inpHashes[j]; }
void genHashes() {
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<ull> uni(1, numeric_limits<ull>::max());
  permHashes[0] = 0;
  inpHashes[0] = 0;
  for (int i = 1; i <= MAX_N; i++) val[i] = uni(rng);
  for (int i = 1; i <= MAX_N; i++) {
    permHashes[i] = permHashes[i - 1] ^ val[i];
    inpHashes[i] = inpHashes[i - 1] ^ val[inp[i]];
  }
}
int solve() {
  int count = 0;
  for (int m = 1; m <= N; m++) {
    if (inp[m] == 1) {
      count++;
      int len = 1;
      unordered_set<int> used;
      if (m - 1 >= 1) len = inp[m - 1];
      for (int l = m - 1; l >= 1 && l + (len = max(len, inp[l])) - 1 >= m;
           l--) {
        if (l + len - 1 > N) continue;
        if (used.find(inp[l]) != used.end()) break;
        used.insert(inp[l]);
        if (permHashes[len] == hashRange(l, l + len - 1)) count++;
      }
      used.clear();
      if (m + 1 <= N) len = inp[m + 1];
      for (int r = m + 1; r <= N && r - (len = max(len, inp[r])) + 1 <= m;
           r++) {
        if (r - len + 1 < 1) continue;
        if (used.find(inp[r]) != used.end()) break;
        used.insert(inp[r]);
        if (permHashes[len] == hashRange(r - len + 1, r)) count++;
      }
    }
  }
  return count;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> inp[i];
  genHashes();
  cout << solve() << endl;
  return 0;
}
