#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template <typename T>
struct segtree{
    int n;
    T UNIT;
    vector<T> dat;
    T (*calc)(T, T);

    segtree(int n_, T unit, T (*_calc)(T, T)){
        UNIT = unit;
        calc = _calc;
        n = 1;
        while(n < n_) n *= 2;
        dat = vector<T>(2*n);
        for(int i = 0; i < 2*n; i++) dat[i] = UNIT;
    }

    void insert(int k, T a){
        dat[k+n-1] = a;
    }
    void update_all(){
        for(int i = n-2; i >= 0; i--){
            dat[i] = calc(dat[i*2+1], dat[i*2+2]);
        }
    }
    //k番目の値(0-indexed)をaに変更
    void update(int k, T a){
        k += n-1;
        dat[k] = a;
        while(k > 0){
            k = (k-1)/2;
            dat[k] = calc(dat[k*2+1], dat[k*2+2]);
        }
    }

    //[a, b)
    //区間[a, b]へのクエリに対してはquery(a, b+1)と呼ぶ
    T query(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        if(r <= a || b <= l) return UNIT;
        if(a <= l && r <= b) return dat[k];
        else{
            T vl = query(a, b, k*2+1, l, (l+r)/2);
            T vr = query(a, b, k*2+2, (l+r)/2, r);
            return calc(vl, vr);
        }
    }
};

int calc_min(int a, int b){ return min(a, b); }
int calc_max(int a, int b){ return max(a, b); }

int n;
int p[100000];
int idx[100001];
int left_large[100000][20];

ll ans;

void reverse_p(){
    vector<int> q(n);
    for(int i = 0; i < n; i++) q[i] = p[i];
    for(int i = 0; i < n; i++) p[i] = q[n-i-1];
    for(int i = 0; i < n; i++) idx[p[i]] = i;
}

const int INF = 1e9;

void make_left_large(){
    left_large[0][0] = -1;
    segtree<int> sgt(n, -INF, calc_max);
    for(int i = 0; i < n; i++) sgt.update(i, p[i]);
    for(int i = 1; i < n; i++){
        int l = 0, r = i;
        if(sgt.query(l, i+1) == p[i]){
            left_large[i][0] = -1;
            continue;
        }
        while(r-l > 1){
            int c = (l+r)/2;
            if(sgt.query(c, i+1) == p[i]) r = c;
            else l = c;
        }
        left_large[i][0] = l;
    }
    for(int i = 1; i < 20; i++){
        for(int j = 0; j < n; j++){
            if(left_large[j][i-1] == -1){
                left_large[j][i] = -1;
                continue;
            }
            left_large[j][i] = left_large[left_large[j][i-1]][i-1];
        }
    }
}

// iからmだけ左に進む
int move_left(int i, int m){
    int cur = i;
    for(int j = 0; j < 20; j++){
        if(cur == -1) break;
        if(m&(1<<j)) cur = left_large[cur][j];
    }
    return cur;
}

void count(){
    make_left_large();
    segtree<int> sgt(n, INF, calc_min);
    for(int i = 0; i < n; i++) sgt.update(i, p[i]);
    for(int i = 1; i < n; i++){
        int l = 0, r = i;
        if(sgt.query(0, i+1) < p[i]){
            while(r-l > 1){
                int c = (l+r)/2;
                if(sgt.query(c, i+1) < p[i]) l = c;
                else r = c;
            }
        }else{
            r = 0;
        }
        if(r == i) continue;
        // [r, i]の範囲で何ペア作成できるかを数える
        int s = 0, t = n+1;
        while(t-s > 1){
            int c = (s+t)/2;
            if(move_left(i, c) < r) t = c;
            else s =c;
        }
        ans += s;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> p[i];
        idx[p[i]] = i;
    }
    count();
    reverse_p();
    count();
    cout << ans << endl;
}