#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<typename T>
struct Binary_Indexed_Tree{
    vector<T> bit;
    const int n;
    
    Binary_Indexed_Tree(const vector<T> &v) : n(sz(v)){
        bit.resize(n+1);
        copy(all(v), bit.begin()+1);
        for(int a = 2; a <= n; a <<= 1){
            for(int b = a; b <= n; b += a){
                bit[b] += bit[b-a/2];
            }
        }
    }
    
    void add(int i, const T &x){
        for(i++; i <= n; i += (i & -i)) bit[i] += x;
    }

    void change(int i, const T&x){
        add(i, x-query(i, i+1));
    }
    
    T sum(int i) const{
        T ret = 0;
        for(; i > 0; i -= (i & -i)) ret += bit[i];
        return ret;
    }
    
    T query(int l, int r) const{
        return sum(r) - sum(l);
    }

    T operator [] (int i) const {return query(i, i+1);}

    int lower_bound(T x) const{
        int ret = 0;
        for(int k = 31-__builtin_clz(n); k >= 0; k--){
            if(ret+(1<<k) <= n && bit[ret+(1<<k)] < x) x -= bit[ret += (1<<k)]; 
        }
        return ret;
    }

    int upper_bound(T x) const {return lower_bound(x+1);}
};

int main(){
    int N; cin >> N;

    vector<int> a(N);
    rep(i, N) {cin >> a[i]; a[i]--;}

    vector<int> A, B, C, D;
    rep(i, N){
        if((i > 0 && a[i-1] < a[i]) || (i == 0 && a[i] > a[i+1])){
            A.eb(a[i]);
            int x = -1;
            if(i-1 >= 0) chmax(x, a[i-1]);
            if(i+1 < N) chmax(x, a[i+1]);
            B.eb(x);
        }
        else{
            C.eb(a[i]);
            int x = inf;
            if(i-1 >= 0) chmin(x, a[i-1]);
            if(i+1 < N) chmin(x, a[i+1]);
            D.eb(x);
        }
    }

    int n = sz(A), m = sz(C);
    vector<int> v(n), u(m);
    iota(all(v), 0), iota(all(u), 0);
    sort(all(v), [&](int i, int j){
        return B[i] < B[j];
    });
    sort(all(u), [&](int i, int j){
        return C[i] < C[j];
    });

    Binary_Indexed_Tree<int> b1(vector<int>(N, 0)), b2(vector<int>(N, 0));

    ll ans = 0;
    each(e, v){
        ans += b1.query(B[e]+1, N);
        b1.add(A[e], 1);
    }

    each(e, u){
        ans += b2.query(C[e]+1, N);
        b2.add(D[e], 1);
    }

    vector<pii> E;
    rep(i, n){
        E.eb(A[i], m+i);
    }
    rep(i, m){
        E.eb(D[i], i);
    }

    Binary_Indexed_Tree<int> b3(vector<int>(N, 0));

    sort(all(E));
    each(e, E){
        int x = e.second;
        if(x >= m){
            x -= m;
            b3.add(B[x], 1);
        }
        else{
            ans += b3.query(0, C[x]);
        }
    }

    cout << ans << '\n';
}