#include <bits/stdc++.h>
#define ll long long
using namespace std;
//const int N = 2e5 + 30;
//#pragma GCC optimize(3)
//#pragma GCC optimize(2)

ll n,a[1000006],h[1000006],cnt[1000006],l=2000006,r=-1,bo,ans,k,kl,kml,kmr,kr,ans2;
//bool bo[1000006];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen("in.txt","r",stdin);
//	freopen("out.txt","w",stdout);
//	freopen("mex.in","r",stdin);
//	freopen("mex.out","w",stdout);
	
	cin>>n;
//	cin>>n;
	for(ll i=1;i<=n;i++){
		cin>>a[i];
//		cin>>a[i];
		h[a[i]]=i;
	}
	for(ll i=0;i<=n;i++){
		bo=0;
		kml=l;
		kmr=r;
		if(i!=n&&l>h[i]){
			l=h[i];
			bo=-1;
		}
		if(i!=n&&r<h[i]){
			r=h[i];
			bo=1;
		}
		if(i==0){
			cnt[i]=(h[i]*(h[i]-1)/2)+((n-h[i])*(n-h[i]+1)/2);
			continue;
		}
		if(i==n){
			cnt[i]=l+(n-r);
			continue;
		}
		if(bo==0){
			cnt[i]=0;
			continue;
		}
		if(bo==-1){
			kl=l;
			kr=n+1;
		}
		if(bo==1){
			kl=0;
			kr=r;
		}
//		cout<<k<<endl;
		cnt[i]=(kml-kl)*(kr-kmr);
	}
	
	for(ll i=0;i<=n;i++){
//		cout<<cnt[i]<<" ";
		ans+=cnt[i]*i;
	}
//	cout<<endl;
	cout<<ans;
	return 0;
}