#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
long long a[300005], b[300005], c[300005], d[300005];
int32_t main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  ;
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i];
  for (long long i = 0, j = 0; i < n; i++) {
    if (i) c[a[i - 1]]--;
    while (j < n && c[a[j]] == 0) c[a[j++]]++;
    b[i] = j - 1;
  }
  d[0] = a[0];
  for (long long i = 1; i < n; i++) d[i] = d[i - 1] + a[i];
  vector<long long> v({-1});
  for (long long i = 0; i < n; i++)
    if (a[i] == 1) v.push_back(i);
  v.push_back(n);
  long long ans = 0;
  for (long long i = 1; i < v.size() - 1; i++) {
    long long r = v[i + 1] - 1;
    long long l = v[i - 1] + 1;
    long long mx = -87;
    for (long long j = v[i]; j <= r; j++) {
      mx = max(mx, a[j]);
      long long k = j - mx + 1;
      if (k >= 0 && b[k] >= j && d[j] - d[k - 1] == mx * (mx + 1) / 2) ans++;
    }
    mx = -87;
    for (long long j = v[i] - 1; j >= l; j--) {
      mx = max(mx, a[j]);
      long long k = j + mx - 1;
      if (k < n && b[j] >= k && d[k] - d[j - 1] == mx * (mx + 1) / 2) ans++;
    }
  }
  cout << ans << endl;
}
