#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
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(b<a){a=b;return 1;}return 0;}

template <class S, S (*op)(S, S), S (*e)()> struct SegmentTree {
  public:
    SegmentTree() : SegmentTree(0) {}
    SegmentTree(int n) : SegmentTree(std::vector<S>(n, e())) {}
    SegmentTree(const std::vector<S>& v) : _n(int(v.size())) {
        log = ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set_val(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S query(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_query() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {//f(op([l,r)))==trueを満たす最大のr
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {//f(op([l,r)))==trueを満たす最小のl
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }

    int ceil_pow2(int n) {
        int x = 0;
        while ((1U << x) < (unsigned int)(n)) x++;
        return x;
    }
};

int n;
int a[200010];

int F(int a,int b){return a+b;}
int e(){return 0;}

void solve(){
    cin >> n;
    rep(i,n) {
        cin >> a[i+1];
    }
    bool f=(a[1]<a[2]);
    if(f){
        a[0]=n+1;
        if(n%2) a[n+1]=n+1;
        else a[n+1]=0;
    }
    else{
        a[0]=0;
        if(n%2) a[n+1]=0;
        else a[n+1]=n+1;
    }
    n+=2;
    SegmentTree<int,F,e> seg(n);
    vector<P> V1={},V2={};
    rep(i,n-2){
        if(a[i+1]>a[i])V1.push_back({max(a[i],a[i+2]),a[i+1]});
        else V2.push_back({min(a[i],a[i+2]),a[i+1]});
    }
    ll ans=0;
    sort(V1.begin(),V1.end());
    sort(V2.begin(),V2.end());
    rep(i,V1.size()){
        //cout << V1[i].first << " " << V1[i].second << endl;
        ans+=lower_bound(V1.begin(),V1.end(),P(V1[i].second,-1))-V1.begin()-i-1;
    }
    //cout << ans << endl;
    rep(i,V2.size()){
        //cout << V2[i].first << " " << V2[i].second << endl;
        ans+=i-(lower_bound(V2.begin(),V2.end(),P(V2[i].second,mod))-V2.begin());
    }
    //cout << ans << endl;
    sort(V1.begin(),V1.end(),[](P a,P b){return a.second<b.second;});
    int idx=0;
    V1.push_back(P(mod,mod));
    // rep(i,V1.size()){
    //     cout << V1[i].first << " " << V1[i].second << endl;
    // }
    rep(i,V2.size()){
        while(V1[idx].second<V2[i].first){
            seg.set_val(V1[idx].first,seg.get(V1[idx].first)+1);
            idx++;
        }
        //cout << i << " " << idx << " " << seg.query(0,V2[i].second) << endl;
        ans+=seg.query(0,V2[i].second);
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}