#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<typename T>
struct BIT{ //1-indexed
    vector<T> bit;
    int size;
    BIT(int n):size(n), bit(n+1, 0){}
    T sum(int i){
        T s=0;
        while(i>0){
            s+=bit[i];
            i-=(i&(-i));
        }
        return s;
    }
    void add(int i, T x){
        while(i<=size){
            bit[i]+=x;
            i+=(i&(-i));
        }
    }
};
template<typename S=int, typename T=ll>
struct RectangleSum{
	int n, m, q;
	vector<S> vx, vy, vyc, ql, qr, qd, qu;
	vector<T> vw, ans;
	RectangleSum(vector<S> vx, vector<S> vy, vector<T> vw, vector<S> ql, vector<S> qr, vector<S> qd, vector<S> qu):n(vx.size()), vx(vx), vy(vy), vw(vw), q(ql.size()), ql(ql), qr(qr), qd(qd), qu(qu), ans(ql.size()){}
	void compress(){
		vyc=vy;
		sort(vyc.begin(), vyc.end());
		vyc.erase(unique(vyc.begin(), vyc.end()), vyc.end());
		m=vyc.size();
	}
	int get(S y){
		return lower_bound(vyc.begin(), vyc.end(), y)-vyc.begin();
	}
	void build(){
		compress();
		vector<int> indl(q), indr(q), indx(n);
		iota(indl.begin(), indl.end(), 0);
		iota(indr.begin(), indr.end(), 0);
		iota(indx.begin(), indx.end(), 0);
		sort(indl.begin(), indl.end(), [&](int i, int j){ return ql[i]<ql[j];});
		sort(indr.begin(), indr.end(), [&](int i, int j){ return qr[i]<qr[j];});
		sort(indx.begin(), indx.end(), [&](int i, int j){ return vx[i]<vx[j];});
		BIT<T> bit(m);
		int il=0, ir=0;
		indx.push_back(n);
		for(auto i:indx){
			while(il<q && (i==n || ql[indl[il]]<=vx[i])){
				ans[indl[il]]-=bit.sum(get(qu[indl[il]]))-bit.sum(get(qd[indl[il]]));
				il++;
			}
			while(ir<q && (i==n || qr[indr[ir]]<=vx[i])){
				ans[indr[ir]]+=bit.sum(get(qu[indr[ir]]))-bit.sum(get(qd[indr[ir]]));
				ir++;
			}
			if(i==n) break;
			bit.add(get(vy[i])+1, vw[i]);
		}
	}
};
int n;
int p[100010];
ll ans;
void solve(int l, int r){
	if(r==l){
		return;
	}
	int m=(l+r)/2;
	int mn=n+1, mx=-1;
	vector<int> vl, vr, vd, vu, vx, vy;
	vector<ll> vw;
	for(int i=m; i>=l; i--){
		mn=min(mn, p[i]);
		mx=max(mx, p[i]);
		if(mx!=p[i]) continue;
		vl.push_back(0), vd.push_back(0);
		vr.push_back(mn+1);
		vu.push_back(mx+1);
	}
	mn=n+1, mx=-1;
	for(int i=m+1; i<=r; i++){
		mn=min(mn, p[i]);
		mx=max(mx, p[i]);
		if(mn!=p[i]) continue;
		vx.push_back(mn), vy.push_back(mx), vw.push_back(1);
	}
	RectangleSum<> recsum(vx, vy, vw, vl, vr, vd, vu);
	recsum.build();
	for(auto c:recsum.ans){
		ans+=c;
	}
	solve(l, m);
	solve(m+1, r);
}
int main()
{
	cin>>n;
	for(int i=0; i<n; i++){
		cin>>p[i];
		p[i]--;
	}
	solve(0, n-1);
	for(int i=0; i<n; i++) p[i]=n-1-p[i];
	solve(0, n-1);
	cout<<ans<<endl;
	return 0;
}