#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

int n;
vi p;

ll calc(int l, int r) {
    if (r - l == 1) {
        return 0;
    }
    int m = (l + r) / 2;
    int ans = calc(l, m) + calc(m, r);

    vector<pii> a;
    int ma = -1;
    int mi = inf;
    for (int i = m - 1; i >= l; i--) {
        chmax(ma, p[i]);
        chmin(mi, p[i]);
        if (mi == p[i]) {
            a.push_back(pii(mi, ma));
        }
    }
    // DEBUG(pii(l, r));
    reverse(all(a));
    // DEBUG_VEC(a);

    vector<pii> b;
    ma = -1; mi = inf;
    for (int i = m; i < r; i++) {
        chmax(ma, p[i]);
        chmin(mi, p[i]);
        if (ma == p[i]) {
            b.push_back(pii(mi, ma));
        }
    }
    // DEBUG_VEC(b);

    int l2 = b.size(), r2 = (int)b.size() - 1;
    rep (i, a.size()) {
        while (a[i].first > b[r2].first) {
            r2--;
            if (r2 == -1) break;
        }
        while (l2 > 0 and a[i].second < b[l2 - 1].second) {
            l2--;
        }
        // DEBUG(pii(l2, r2));
        if (r2 >= l2) {
            ans += r2 - l2 + 1;
        }
    }
    return ans;
}

signed main() {
    fio();
    cin >> n;
    p.resize(n);
    rep (i, n) {
        cin >> p[i];
        p[i]--;
    }

    ll ans = calc(0, n);
    reverse(all(p));
    ans += calc(0, n);
    cout << ans << endl;
}