/*
Author: QAQ Automaton
Lang: C++
Prog: E.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	// input a signed integer
	inline bool read (signed &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}

	inline bool read (long long &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		x=gc();
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r')if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	// print a signed integer
	inline bool write (signed x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}

	inline bool write (long long x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int inf;
struct _init_{
    _init_(){
        memset(&inf,0x3f,sizeof(inf));
    }
};
_init_ ___INIT__;
int a[100005];
int at[100005];
int ls[19][100005];
int rs[19][100005];
int s[100005],t;
ll ans;
ll fl[19][100005],fr[19][100005];
void calc(int x){
	if(x-ls[0][x]<=rs[0][x]-x){
		int mxl=0;
		for(int lr=x;lr>ls[0][x];--lr){
			if(lr!=x)chkmax(mxl,a[lr]);
			int rr=x+1;
			for(int i=18;~i;--i)if(rs[i][rr]<rs[0][x] &&a[rs[i][rr]]<=mxl)rr=rs[i][rr];
			if(a[rr]<=mxl)rr=rs[0][rr];
			ans+=(ll)mxl*(min(rr,rs[0][x])-x);
			for(int i=18;~i;--i)if(rs[i][rr]<=rs[0][x]){
				ans+=fr[i][rr];
				rr=rs[i][rr];
			}
			if(rr<rs[0][x])ans+=(ll)a[rr]*(rs[0][x]-rr);
		} 
	} else{
		int mxl=0;
		for(int rr=x;rr<rs[0][x];++rr){
			if(rr!=x)chkmax(mxl,a[rr]);
			int lr=x-1;
			for(int i=18;~i;--i)if(ls[i][lr]>ls[0][x] &&a[ls[i][lr]]<=mxl)lr=ls[i][lr];
			if(a[lr]<=mxl)lr=ls[0][lr];
			ans+=(ll)mxl*(x-max(lr,ls[0][x]));
			for(int i=18;~i;--i)if(ls[i][lr]>=ls[0][x]){
				ans+=fl[i][lr];
				lr=ls[i][lr];
			}
			if(lr>ls[0][x])ans+=(ll)a[lr]*(lr-ls[0][x]);
		}
	}
//	ls[0][x] rs[0][x]
}
signed main(){
#ifdef QAQAutoMaton 
	freopen("E.in","r",stdin);
	freopen("E.out","w",stdout);
#endif
	int n;
	read(n);
	for(int i=1;i<=n;++i){
		read(a[i]);
		at[a[i]]=i;
	}
	t=0;
	for(int i=1;i<=n;++i){
		while(t && a[s[t]]<a[i])--t;
		ls[0][i]=s[t];
		fl[0][i]=(ll)a[i]*(i-ls[0][i]);
		s[++t]=i;
	}
	s[t=0]=n+1;
	for(int i=0;i<=18;++i)rs[i][n+1]=n+1;
	for(int i=n;i;--i){
		while(t && a[s[t]]<a[i])--t;
		rs[0][i]=s[t];
		fr[0][i]=(ll)(rs[0][i]-i)*a[i];
		s[++t]=i;
	}
	for(int i=1;i<=18;++i)for(int j=1;j<=n;++j){
		ls[i][j]=ls[i-1][ls[i-1][j]];
		rs[i][j]=rs[i-1][rs[i-1][j]];
		fl[i][j]=fl[i-1][j]+fl[i-1][ls[i-1][j]];
		fr[i][j]=fr[i-1][j]+fr[i-1][rs[i-1][j]];
	}
	for(int i=1;i<=n;++i){
		calc(i);
	}
	write(ans,'\n');
	return 0;
}



Measured memory_bytes: 49408