#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;

const int nn=212345;
ll bit[nn+1];

ll sum(int i){ ++i;
  ll s=0;
  while(i>0){
    s+=bit[i];
    i-=i&-i;
  }
  return s;
}

void add(int i,ll x){ ++i; ++i;
  while(i<=nn){
    bit[i]+=x;
    i+=i&-i;
  }
}

ll solve(vector<pii> ps){
	fill(bit,bit+nn+1,0);
	vv<int> ad(202345);
	vv<int> qs(202345);
	for(cauto [x,y]:ps){
		ad[y].eb(x);
		qs[x].eb(y);
	}
	ll re=0;
	rep(y,202345){
		for(cauto x:ad[y]) add(x,1);
		for(cauto x:qs[y]) re+=sum(202345)-sum(x);
	}
	out(ps,(re-ps.size())/2,re,1);
	return (re-ps.size())/2;
}
ll solve(vector<pii> ps,vector<pii> ps2){
	fill(bit,bit+nn+1,0);
	vv<int> ad(202345);
	vv<int> qs(202345);
	for(cauto [x,y]:ps) qs[y].eb(x);
	for(cauto [x,y]:ps2) ad[x].eb(y);
	ll re=0;
	rep(y,202345){
		for(cauto x:ad[y]) add(x,1);
		for(cauto x:qs[y]) re+=sum(x+1);
	}
	return re;
	// ll re=0;
	// for(cauto [x,y]:ps)
	// 	for(cauto [X,Y]:qs){
	// 		if(x>=Y && X<=y) ++re;
	// 	}
	// out(re,1);
	// return re;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	cauto n=read();
	auto vs=readV(n,1);
	if(vs[0]>vs[1]) for(auto &v:vs) v=n-1-v;
	vs.insert(vs.begin(),n);
	vs.eb(n%2?n:-1);
	vector<pii> lbs,ubs;
	reps(i,1,n+1){
		if(vs[i-1]<vs[i]){
			lbs.eb(vs[i],max(vs[i-1],vs[i+1])+1);
		}else{
			ubs.eb(vs[i],min(vs[i-1],vs[i+1])-1);
		}
	}
	out(lbs,ubs,1);
	ll re=solve(lbs)+solve(ubs,lbs);
	for(auto &[a,b]:ubs) swap(a,b);
	re+=solve(ubs);
	cout<<re NL;
  return 0;
}