#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 200000
#define LL long long
int stk[MAXN+5];
int n,top;
LL a[MAXN+5],d[MAXN+5],ans;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		while(a[stk[top]]>=a[i])top--;
		d[i]=stk[top];stk[++top]=i;
	}
	top=0,stk[0]=n+1;
	for(int i=n;i>=1;i--)
	{
		while(a[stk[top]]>=a[i])top--;
		ans+=a[i]*(i-d[i])*(stk[top]-i);stk[++top]=i;
	}
	printf("%lld",ans);
}