#include <bits/stdc++.h>

using namespace std;
long long mod=1000000007;
long long f(long long l, long long r, long long k, long long p)
{
    l++; r++;
    long long q;
  if(k>p){
      k--;
    
       p=(l*(r*(r+l))%mod*500000004%mod)%mod;
    
    if(k>=r-1) q=(l)*((k+k-r+1)*r%mod)%mod*500000004%mod;
    else q=(l)*k%mod*(k+1)%mod*500000004%mod;
    long long a=l-1,b=max((long long)0,k-r);
    if(a<b) swap(a,b);
    return (p+q+(a+1)*b%mod*(b+1)%mod*500000004%mod-b*(b+1)%mod*(b+2)%mod*166666668%mod+mod)%mod;
}
    else
    {
        k=p;
        k++;
        swap(l,r);
       p=(l*(r*(r+l))%mod*500000004%mod-(k)*(l)%mod+mod)%mod;
    
    if(k>=r-1) q=(l)*((k+k-r+1)*r%mod)%mod*500000004%mod;
    else q=(l)*k%mod*(k+1)%mod*500000004%mod;
    long long a=l-1,b=max((long long)0,k-r);
    if(a<b) swap(a,b);
    return (p+q+(a+1)*b%mod*(b+1)%mod*500000004%mod-b*(b+1)%mod*(b+2)%mod*166666668%mod+mod)%mod;
    }
}
long long l[9000009],r[9000009],r1[2000009],l1[2000009];
long long solve(vector <long long> A) {
    int R=A.size()-1;
    stack<long long> S;
    for (long long i=0; i<A.size(); i++)
    {
        while(S.size() && A[S.top()]<=A[i])
            S.pop();
        if(S.size()==0){ l[i]=0;
                        while(A[R]<A[i] && R>i) R--;
                        r1[i]=R+1;
                       }
        else l[i]=S.top()+1,r1[i]=A.size();
        S.push(i);
    }
    int L=0;
    while(S.size()) S.pop();
    for (long long i=A.size()-1; i>=0; i--)
    {
        while(S.size() && A[S.top()]<A[i])
            S.pop();
        if(S.size()==0) {r[i]=A.size()-1;
                        while(A[L]<=A[i] && L<i) L++;
                         l1[i]=L-1;
                        }
        else r[i]=S.top()-1,l1[i]=-1;
        S.push(i);
    }
    long long ans=0,k=0,x=0,n=A.size();
    long long N=(n*(n+1)/2)%1000000007*((n*(n+1)/2+1)%1000000007)%1000000007*500000004%1000000007;
    for (long long i=0; i<A.size(); i++)
    {ans=(ans+A[i]*f(i-l[i],r[i]-i,l1[i]+1,A.size()-r1[i]))%1000000007,
    k=(k+f(i-l[i],r[i]-i,l1[i]+1,A.size()-r1[i])+mod+mod)%mod,x=max(x,(long long)A[i]);
    }
    cout<< (ans+x*(N-k+1000000007)%1000000007+1000000007)%1000000007<<endl;
    return 0;
}

int main() {
    long long n;
    cin >> n;
   // srand(time(NULL));
   // n=200000;
    vector<long long> a(n);
    for(long long a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
     //   a[a_i]=1000000;
    }
    long long result = solve(a);
  // cout << result << endl;
    return 0;
}