#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse4")
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int mod=1000000007,_2=500000004;
int N,MX=0,tp,a[200010],i_1[200010],st[200010],mxl[200010],mxr[200010],sxl[200010],sxr[200010];
long long M,CNT,ANS=0;
void calc(int w,int x,int y){
	 if (x<y){
		swap(x,y);
	 }
	 int k;
	 if (x==y){
		k=(((long long)(x+y)*i_1[y]%mod-(long long)x*x%mod)%mod+mod)%mod;
	 }
	 else{
	 	  k=(((long long)y*(i_1[x-1]-i_1[y])%mod+(long long)(x+y)*i_1[y]%mod)%mod+mod)%mod;
	 }
	 ANS=(ANS+(long long)w*k)%mod;
	 CNT=CNT-k;
	 if (CNT<0){
		CNT+=mod;
	 }
}
void calcl(int w,int x,int y){
	 if (x==1||y==0){
		return;
	 }
	 int k;
	 if (y<x){
	 	k=i_1[y];
	 }
	 else{
		  k=(i_1[x-1]+(long long)(y-x+1)*(x-1))%mod;
	 }
	 ANS=(ANS+(long long)w*k)%mod;
	 CNT=CNT-k;
	 if (CNT<0){
		CNT+=mod;
	 }
}
void calcr(int w,int x,int y){
	 if (x==0||y==1){
		return;
	 }
	 int k;
	 if (y+1<=x){
		k=i_1[y-1];
	 }
	 else{
		  k=(i_1[x]+(long long)(y-x-1)*x)%mod;
	 }
	 ANS=(ANS+(long long)w*k)%mod;
	 CNT=CNT-k;
	 if (CNT<0){
		CNT+=mod;
	 }
}
int main(){
	int p;
	scanf("%d",&N);
	for (int i=1;i<=N;i++){
		scanf ("%d",&a[i]);
		MX=max(MX,a[i]);
	}
	M=((long long)N*(N+1)>>1)%mod;
	M=(long long)M*(M+1)%mod*_2%mod;
	CNT=M;
	for (int i=1;i<=N;i++){
        i_1[i]=(i_1[i-1]+i)%mod;
	}
	for (int i=1;i<=N;i++){
		sxl[i]=max(sxl[i-1],a[i]);
	}
	for (int i=N;i;i--){
		sxr[i]=max(sxr[i+1],a[i]);
	}
	tp=0;
	for (int i=1;i<=N;i++){
		while (tp>0&&a[st[tp]]<=a[i]){
			  tp--;
		}
		if (tp){
		   mxl[i]=st[tp]+1;
		}
		else{
			 mxl[i]=1;
		}
		st[++tp]=i;
	}
	tp=0;
	for (int i=N;i;i--){
		while (tp>0&&a[st[tp]]<a[i]){
			  tp--;
		}
		if (tp){
		   mxr[i]=st[tp]-1;
		}
		else{
			 mxr[i]=N;
		}
		st[++tp]=i;
	}
	for (int i=1;i<=N;i++){
		calc(a[i],i-mxl[i]+1,mxr[i]-i+1);
	}
	p=N;
	for (int i=1;i<=N;i++){
		int g=sxl[i];
		while (p>i&&sxr[p]<g){
			  p--;
		}
		while (p<i){
			  p++;
		}
  		calcl(g,i,N-p);
	}
	p=1;
	for (int i=N;i;i--){
		int g=sxr[i];
		while (p<i&&sxl[p]<=g){
			  p++;
		}
		while (p>i){
			  p--;
		}
		calcr(g,N-i+1,p-1);
	}
	CNT=(CNT%mod+mod)%mod;
	ANS=(ANS+(long long)CNT*MX)%mod;
	printf("%lld",ANS);
	return 0;
}