#include <bits/stdc++.h>
using namespace std;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
using Int = long long;
const char newl = '\n';


struct FullyIndexableDictionary{
  Int len,blk;
  vector<unsigned> bit;
  vector<Int> sum;

  FullyIndexableDictionary(){}
  FullyIndexableDictionary(Int len)
    :len(len),blk((len+31)>>5),bit(blk,0),sum(blk,0){}

  void set(Int k){
    bit[k>>5]|=1u<<(k&31);
  }

  void build(){
    sum[0]=0;
    for(Int i=1;i<blk;i++)
      sum[i]=sum[i-1]+__builtin_popcount(bit[i-1]);
  }

  bool operator[](Int k) const{
    return bool((bit[k>>5]>>(k&31))&1);
  }

  Int rank(Int k){
    return sum[k>>5]+__builtin_popcount(bit[k>>5]&((1u<<(k&31))-1));
  }

  Int rank(bool v,Int k){
    return (v?rank(k):k-rank(k));
  }

  Int select(bool v,Int k){
    if(k<0||rank(v,len)<=k) return -1;
    Int l=0,r=len;
    while(l+1<r){
      Int m=(l+r)>>1;
      if(rank(v,m)>=k+1) r=m;
      else l=m;
    }
    return r-1;
  }

  Int select(bool v,Int i,Int l){
    return select(v,i+rank(v,l));
  }
};

template<class T,Int MAXLOG>
struct WaveletMatrix{
  Int len;
  FullyIndexableDictionary mat[MAXLOG];
  Int zs[MAXLOG],buff1[MAXLOG],buff2[MAXLOG];
  static const T npos=-1;

  WaveletMatrix(vector<T> data){
    len=data.size();
    vector<T> ls(len),rs(len);
    for(Int dep=0;dep<MAXLOG;dep++){
      mat[dep]=FullyIndexableDictionary(len+1);
      Int p=0,q=0;
      for(Int i=0;i<len;i++){
        bool k=(data[i]>>(MAXLOG-(dep+1)))&1;
        if(k) rs[q++]=data[i],mat[dep].set(i);
        else  ls[p++]=data[i];
      }
      zs[dep]=p;
      mat[dep].build();
      swap(ls,data);
      for(Int i=0;i<q;i++) data[p+i]=rs[i];
    }
  }

  T access(Int k){
    T res=0;
    for(Int dep=0;dep<MAXLOG;dep++){
      bool bit=mat[dep][k];
      res=(res<<1)|bit;
      k=mat[dep].rank(bit,k)+zs[dep]*dep;
    }
    return res;
  }

  // return the number of v in [0,k)
  Int rank(T v,Int k){
    Int l=0,r=k;
    for(Int dep=0;dep<MAXLOG;dep++){
      buff1[dep]=l;buff2[dep]=r;
      bool bit=(v>>(MAXLOG-(dep+1)))&1;
      l=mat[dep].rank(bit,l)+zs[dep]*bit;
      r=mat[dep].rank(bit,r)+zs[dep]*bit;
    }
    return r-l;
  }

  // return the position of k-th v
  Int select(T v,Int k){
    rank(v,len);
    for(Int dep=MAXLOG-1;dep>=0;dep--){
      bool bit=(v>>(MAXLOG-(dep+1)))&1;
      k=mat[dep].select(bit,k,buff1[dep]);
      if(k>=buff2[dep]||k<0) return -1;
      k-=buff1[dep];
    }
    return k;
  }

  Int select(T v,Int k,Int l){
    return select(v,k+rank(v,l));
  }

  // return k-th largest value in [l,r)
  T quantile(Int l,Int r,Int k){
    if(r-l<=k||k<0) return -1;
    T res=0;
    for(Int dep=0;dep<MAXLOG;dep++){
      Int p=mat[dep].rank(1,l);
      Int q=mat[dep].rank(1,r);
      if(q-p>k){
        l=p+zs[dep];
        r=q+zs[dep];
        res|=T(1)<<(MAXLOG-(dep+1));
      }else{
        k-=(q-p);
        l-=p;
        r-=q;
      }
    }
    return res;
  }

  T rquantile(Int l,Int r,Int k){
    return quantile(l,r,r-l-k-1);
  }

  Int freq_dfs(Int d,Int l,Int r,T val,T a,T b){
    if(l==r) return 0;
    if(d==MAXLOG) return (a<=val&&val<b)?r-l:0;
    T nv=T(1)<<(MAXLOG-d-1)|val;
    T nnv=((T(1)<<(MAXLOG-d-1))-1)|nv;
    if(nnv<a||b<=val) return 0;
    if(a<=val&&nnv<b) return r-l;
    Int lc=mat[d].rank(1,l),rc=mat[d].rank(1,r);
    return freq_dfs(d+1,l-lc,r-rc,val,a,b)
      +freq_dfs(d+1,lc+zs[d],rc+zs[d],nv,a,b);
  }

  // return number of points in [left, right) * [lower, upper)
  Int rangefreq(Int left,Int right,T lower,T upper){
    return freq_dfs(0,left,right,0,lower,upper);
  }

  pair<Int, Int> ll(Int l,Int r,T v){
    Int res=0;
    for(Int dep=0;dep<MAXLOG;dep++){
      buff1[dep]=l;buff2[dep]=r;
      bool bit=(v>>(MAXLOG-(dep+1)))&1;
      if(bit) res+=r-l+mat[dep].rank(bit,l)-mat[dep].rank(bit,r);
      l=mat[dep].rank(bit,l)+zs[dep]*bit;
      r=mat[dep].rank(bit,r)+zs[dep]*bit;
    }
    return make_pair(res,r-l);
  }

  Int lt(Int l,Int r,T v){
    auto p=ll(l,r,v);
    return p.first;
  }

  Int le(Int l,Int r,T v){
    auto p=ll(l,r,v);
    return p.first+p.second;
  }

  T succ(Int l,Int r,T v){
    Int k=le(l,r,v);
    return k==r-l?npos:rquantile(l,r,k);
  }

  T pred(Int l,Int r,T v){
    Int k=lt(l,r,v);
    return k?rquantile(l,r,k-1):npos;
  }
};

//INSERT ABOVE HERE

Int solve(vector<Int> ps){
  Int n=ps.size();
  vector<Int> rs(n);
  for(Int i=0;i<n;i++) rs[ps[i]]=i;

  // [i, x_i)
  vector<Int> xs(n);
  {
    set<Int> ss;
    ss.emplace(n);
    for(Int i=0;i<n;i++){
      xs[rs[i]]=*ss.upper_bound(rs[i]);
      ss.emplace(rs[i]);
    }
  }
  // [y_i, i]
  vector<Int> ys(n);
  {
    set<Int> ss;
    ss.emplace(-1);
    for(Int i=n-1;i>=0;i--){
      ys[rs[i]]=*--ss.lower_bound(rs[i])+1;
      ss.emplace(rs[i]);
    }
  }

  if(0){
    for(Int i=0;i<n;i++)
      cout<<i<<':'<<xs[i]<<' '<<ys[i]<<newl;
    cout<<newl;
  }

  Int res=0;
  WaveletMatrix<Int, 20> wm(ys);
  for(Int i=0;i<n;i++)
    res+=(xs[i]-i)-wm.rangefreq(i,xs[i],i+1,xs[i])-1;

  if(0){
    for(Int i=0;i<n;i++)
      cout<<i<<':'<<(xs[i]-i)-wm.rangefreq(i,xs[i],i+1,xs[i])-1<<newl;
    cout<<newl;
  }
  return res;
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  Int n;
  cin>>n;
  vector<Int> ps(n);
  for(Int i=0;i<n;i++) cin>>ps[i],ps[i]--;

  Int ans=0;
  ans+=solve(ps);
  reverse(ps.begin(),ps.end());
  ans+=solve(ps);
  cout<<ans<<newl;
  return 0;
}