#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int a[N], mx[N];
unsigned long long f[N], s[N], S[N];

signed main() {
    int n, res = 0; scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    mt19937_64 rnd;
    for (int i = 1; i <= n; ++i) f[i] = rnd(), S[i] = S[i - 1] + f[i];
    for (int i = 1; i <= n; ++i) if (a[i] == 1) {
        ++res;
        int L = i, R = i; s[i] = f[a[i]], mx[i] = a[i];
        while (L - 1 >= 1 && a[L - 1] != 1) --L, s[L] = s[L + 1] + f[a[L]], mx[L] = max(mx[L + 1], a[L]);
        while (R + 1 <= n && a[R + 1] != 1) ++R, s[R] = s[R - 1] + f[a[R]], mx[R] = max(mx[R - 1], a[R]);
        auto chk = [&](int x, int y) {
            return x <= i && i <= y && s[x] + s[y] - f[a[i]] == S[max(mx[x], mx[y])];
        };
        for (int j = L; j < i; ++j) res += chk(j, j + mx[j] - 1);
        for (int j = R; j > i; --j) res += chk(j - mx[j] + 1, j);
    }
    printf("%d\n", res);
    return 0;
}