//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
template<typename T>
struct BIT{
  ll n;
  ll k=1;
  vector<T>data;
  BIT() = default;
  BIT(ll size):n(size){
    data.assign(n,0);
    while(k*2<=n)k*=2;
  }
  void add(ll a,T w){
    for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w;
  }
  T sum(ll a){
	if(a<0)return 0;
    T ret = 0;
    for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1];
    return ret;
  }
  T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);}
  T operator[](ll pos){
    return sum(pos,pos);
  }
  ll lower_bound(ll x){
    ll ret=0;    
    for(ll i=k;i>0;i/=2){
      if(ret+i<=n&&data[ret+i-1]<x){
        x-=data[ret+i-1];
        ret+=i;
      }
    }
    return ret;
  }
  void print(){
    for(ll i=0;i<n;i++){
      if(i!=0)cout<<" ";
      cout<<(*this)[i];
    }
    cout<<endl;
  }
};
//0-indexedで各値が何番目に小さいかを返す

template<typename T>
map<T,ll> compress(vector<T> &v){
  auto t=v;
  sort(ALL(t));
  t.erase(unique(ALL(t)),t.end());
  map<T, ll> ret;
  for(ll i=0;i<(ll)t.size();i++)
    ret[t[i]]=i;
  return ret;
}
ll ret=0;
ll calc(vector<P>&a,vector<P>&b){
  vector<ll>val;
  for(auto z:a)val.PB(z.fi),val.PB(z.se);
  for(auto z:b)val.PB(z.fi),val.PB(z.se);
  //debug(val,val.size());
  auto mp=compress(val);
  ll sz=mp.size();
  BIT<ll>bit(sz);
  sort(ALL(a));
  sort(ALL(b));
  ll idx=0;
  rep(i,0,a.size()){
    while(idx<b.size()&&b[idx].fi<a[i].fi){
      bit.add(mp[b[idx].se],1);idx++;
    }
    //bit.print();
    //cout<<mp[a[idx].se] spa a[idx].se<<endl;
    ret+=bit.sum(mp[a[i].se]);
  }
}


void solve(ll l,ll r,vector<ll>&p){
  if(l+1>=r)return;
  ll m=(l+r)/2;
  //cout<<l spa r spa m spa ret<<endl;
  {
    vector<P>a,b;
    ll mi=INF,mx=-INF;
    rrep(i,l,m){
      chmin(mi,p[i]);
      if(mx<p[i]){
        chmax(mx,p[i]);
        a.EB(mi,mx);
      }
    }
    mi=INF,mx=-INF;
    rep(i,m,r){
      chmax(mx,p[i]);
      if(mi>p[i]){
        chmin(mi,p[i]);
        b.EB(mi,mx);
      }
    }
    //debug(a,a.size());debug(b,b.size());//cout<<ret<<endl;
    calc(a,b);
  }
  {
    vector<P>a,b;
    ll mi=INF,mx=-INF;
    rep(i,m,r){
      chmin(mi,p[i]);
      if(mx<p[i]){
        chmax(mx,p[i]);
        a.EB(mi,mx);
      }
    }
    mi=INF,mx=-INF;
    rrep(i,l,m){
      chmax(mx,p[i]);
      if(mi>p[i]){
        chmin(mi,p[i]);
        b.EB(mi,mx);
      }
    }
    //debug(a,a.size());debug(b,b.size());cout<<ret<<endl;
    calc(a,b);
  }
  solve(l,m,p);
  solve(m,r,p);
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>p(n);
  rep(i,0,n)cin>>p[i];
  solve(0,n,p);
  cout<<ret<<endl;
  return 0;
}