#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template<typename dtype, dtype initValue/*範囲外のときに返す値*/>
class RMQ{
public:
  int n,n_;
  vector<dtype> dat;
  int toMax;

  //初期化
  RMQ(){n=-1;}
  RMQ(int n_,int toMax = 0):n_(n_),toMax(toMax){
    n=1;
    while(n<n_)n*=2;
    dat.resize(2*n-1,initValue);
  }

  inline dtype merge(dtype a,dtype b){return toMax? max(a, b):min(a, b); }

  //k番目の値をaに変更
  void update(int k,dtype a){
    k+=n-1;
    dat[k]=a;
    while(k>0){
      k=(k-1)/2;
      dat[k]=merge(dat[k*2+1],dat[k*2+2]);
    }
  }

  dtype dfs(int a,int b,int k,int l,int r){
    if(r<=a||b<=l)return initValue;
    if(a<=l&&r<=b)return dat[k];
    dtype vl = dfs(a,b,k*2+1,l,(l+r)/2);
    dtype vr = dfs(a,b,k*2+2,(l+r)/2,r);
    return merge(vl,vr);
  }

  //[a,b)の最小値を求める
  dtype get(int a,int b){
    assert(a <= b), assert(a <= n_ && b <= n_), assert(a >= 0 && a >= 0);
    return dfs(a,b,0,0,n);
  }
};

Int solve(Int N, vector<Int> A){
  vector<Int> Idx(N);
  for(Int i=0;i<N;i++) Idx[A[i]] = i;

  RMQ<Int, -INF> seg(N, 1);
  for(Int i=0;i<N;i++) seg.update(i, A[i]);

  auto get = [&](Int l, Int r){ //[l, r)
    Int top = seg.get(l, r);
    seg.update(Idx[top], -INF);
    Int top2 = seg.get(l, r);
    seg.update(Idx[top], top);
    return top2;
  };

  auto calc = [&](Int l){
    Int L = 0, R = N - l;
    while(L + 1 < R){
      Int M = (L + R) / 2;
      if( seg.get(l, l + M + 1) == A[l]) L = M;
      else R = M;
    }
    return l + L;
  };

  auto calc1 = [&](Int l, Int L){
    Int R = N - l;
    while(L + 1 < R){
      Int M = (L + R) / 2;
      if( get(l, l + M + 1) == A[l] ) L = M;
      else R = M;
    }
    return l + L;
  };

  auto calc2 = [&](Int l){
    Int L = 0, R = l + 1;
    while(L + 1 < R){
      Int M = (L + R) / 2;
      if( seg.get(l - M, l+1) == A[l] ) L = M;
      else R = M;
    }
    return L;
  };

  Int ans = 0;
  for(Int i=0;i<N - 1;i++){
    Int numRight = calc(i) + 1;
    if(numRight == N) continue;
    Int len = calc1(i, numRight - i) - numRight + 1;
    Int numLeft = calc2(i) + 1;
    Int score = len * numLeft * (A[i] + 1);
    //pr(i, A[i], numRight, calc1(i, numRight - i), len, numLeft, score);
    ans += score;
  }
  return ans;
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N;
  cin>>N;
  vector<Int> A(N);
  cin>>A;
  for(Int i=0;i<N;i++) A[i]--;

  Int a = solve(N, A);
  reverse(A.begin(), A.end());
  Int b = solve(N, A);
  Int ans = a + b;
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 4700