#include <bits/stdc++.h>
#define inf 1000000007
#define ll long long int
using namespace std;

int n;

vector<ll> seg1(5000000),lazy1(5000000),seg2(5000000),lazy2(5000000);
void build(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e,vector<ll> &v)
{
  if(b == e)
  {
    seg[node] = (b+1LL)*v[b]%inf;
    lazy[node] = 0;
    //cout<<"b = "<<b<<" e = "<<e<<" seg[node] = "<<seg[node]<<"\n";
    return;
  }
  int m = (b+e)>>1;
  build(seg,lazy,2*node,b,m,v);
  build(seg,lazy,2*node+1,m+1,e,v);
  seg[node] = (seg[2*node]+seg[2*node+1])%inf;
  lazy[node] = 0;
 // cout<<"b = "<<b<<" e = "<<e<<" seg[node] = "<<seg[node]<<"\n";
}

void update(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e,int i, int j,ll val)
{
  if(lazy[node]) 
  {
    seg[node] = ((500000004LL*(e-b+1LL)%inf)*(e+b+2LL)%inf)*lazy[node]%inf;
    if(b!=e)
    {
      lazy[2*node] =  lazy[node];
      lazy[2*node+1] = lazy[node];
    }
    lazy[node] = 0;
  }
  if(b > j || e < i) return;
  if(b >= i && e <= j)
  {
     seg[node] = ((500000004LL*(e-b+1LL)%inf)*(e+b+2LL)%inf)*val%inf;
    if(b!=e)
    {
      lazy[2*node] = val;
      lazy[2*node+1] = val;
    }
    return;
  }
  int m = (b+e)>>1;
  update(seg,lazy,2*node,b,m,i,j,val);
  update(seg,lazy,2*node+1,m+1,e,i,j,val);
  seg[node] = (seg[2*node]+seg[2*node+1])%inf;
}

ll query(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e,int i, int j)
{
  if(b > j || e < i) return 0;
  if(lazy[node]) 
  {
    seg[node] = ((500000004LL*(e-b+1LL)%inf)*(e+b+2LL)%inf)*lazy[node]%inf;
    if(b!=e)
    {
      lazy[2*node] =  lazy[node];
      lazy[2*node+1] = lazy[node];
    }
    lazy[node] = 0;
  }
  if(b >= i && e <= j) return seg[node];
  int m = (b+e)>>1;
  return (query(seg,lazy,2*node,b,m,i,j)+query(seg,lazy,2*node+1,m+1,e,i,j))%inf;
}

void build1(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e, vector<ll> &v)
{
  if(b == e)
  {
    seg[node] = v[b];
    lazy[node] = 0;
    //cout<<"b = "<<b<<" e = "<<e<<" seg[node] = "<<seg[node]<<"\n";
    return;
  }
  int m = (b+e)>>1;
  build1(seg,lazy,2*node,b,m,v);
  build1(seg,lazy,2*node+1,m+1,e,v);
  seg[node] = (seg[2*node]+seg[2*node+1])%inf;
  lazy[node] = 0;
  //cout<<"b = "<<b<<" e = "<<e<<" seg[node] = "<<seg[node]<<"\n";
}

void update1(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e,int i, int j,ll val)
{
  if(lazy[node]) 
  {
    seg[node] = (e-b+1LL)*lazy[node]%inf;
    if(b!=e)
    {
      lazy[2*node] =  lazy[node];
      lazy[2*node+1] = lazy[node];
    }
    lazy[node] = 0;
  }
  if(b > j || e < i) return;
  if(b >= i && e <= j)
  {
    seg[node] = (e-b+1LL)*val%inf;
    if(b!=e)
    {
      lazy[2*node] = val;
      lazy[2*node+1] = val;
    }
    return;
  }
  int m = (b+e)>>1;
  update1(seg,lazy,2*node,b,m,i,j,val);
  update1(seg,lazy,2*node+1,m+1,e,i,j,val);
  seg[node] = (seg[2*node] + seg[2*node+1])%inf;
}

ll query1(vector<ll> &seg, vector<ll> &lazy, int node, int b, int e,int i, int j)
{
  if(b > j || e < i) return 0;
 if(lazy[node]) 
  {
    seg[node] = (e-b+1LL)*lazy[node]%inf;
    if(b!=e)
    {
      lazy[2*node]  =  lazy[node];
      lazy[2*node+1] = lazy[node];
    }
    lazy[node] = 0;
  }
  if(b >= i && e <= j) return seg[node];
  int m = (b+e)>>1;
  return (query1(seg,lazy,2*node,b,m,i,j)+query1(seg,lazy,2*node+1,m+1,e,i,j))%inf;
}

int solve(vector <ll> A)
{
   ll sum1 = 0, co = 0;
   if( n > 3)
   {
     vector<ll> v;
     ll ma = max(A[n-1],A[0]);
     for(int i  = 1;i < n-2; i++) 
     {
        ma = max(ma,A[i]);
        v.push_back(ma);
     }
     //cout<<"max array = "; for(int i = 0;i < n-3; i++) cout<<v[i]<<" "; cout<<"\n";
     build(seg1,lazy1,1,0,n-4,v);
     build1(seg2,lazy2,1,0,n-4,v);
     ma = v[0];
     vector<ll>::iterator it = v.begin(),jt;
     for(int i = 0; i < n-3;i++)
     {
        ll tsum = 0;
        tsum = (tsum+query(seg1,lazy1,1,0,n-4,0,min(i,n-4-i)))%inf; 
        ll k = min(i,n-4-i)+1;
        co = (co + (500000004LL*k%inf)*(k+1LL)%inf)%inf;
        //cout<<"tsum1 = "<<tsum<<"\n";
        if( (i+1) <= (n-4-i)) 
          {
            tsum = (tsum + (i+1LL)*query1(seg2,lazy2,1,0,n-4,i+1,(n-4-i))%inf)%inf;
            co = (co + (i+1LL)*(n - 4LL - i - i +inf )%inf)%inf;
          }
        //cout<<"tsum2 = "<<tsum<<"\n";
        //cout<<"\n";
        if(A[n-2-i] > ma)
        {

          int h = ((jt = upper_bound(it,v.end(),A[n-2-i])) - v.begin()) - 1;
          //cout<<"A[n-2-i] = "<<A[n-2-i]<<" h = "<<h<<"\n";
          it = --jt;
          ma = A[n-2-i];
          update(seg1,lazy1,1,0,n-4,0,h,A[n-2-i]);
          update1(seg2,lazy2,1,0,n-4,0,h,A[n-2-i]);
        }
        //cout<<"co = "<<co<<"\n";
        sum1  = (sum1 + tsum)%inf;
     }
   }
   ll r[n],l[n];
   r[n-1] = 0;
   stack<int> s;
   s.push(n-1);
   for(int i = n-2; i >= 0; i--)
   {
      while(!s.empty() && A[s.top()] < A[i]) s.pop();
      if(!s.empty()) r[i] = s.top() - i - 1;
      else r[i] = n - i - 1;
      s.push(i);
   }
   while(!s.empty()) s.pop();
   l[0] = 0;
   s.push(0);
   for(int i = 1; i < n; i++)
   {
      while(!s.empty() && A[s.top()] <= A[i]) s.pop();
      if(!s.empty()) l[i] = i - s.top() -1;
      else l[i] = i;
      s.push(i);
   }
  // cout<<"r :"; for(int i = 0; i < n; i++) cout<<r[i]<<" "; cout<<"\n";
  // cout<<"l :"; for(int i = 0; i < n; i++) cout<<l[i]<<" "; cout<<"\n"; 
   ll sum2 = 0;
   for(int i = 0; i < n; i++)
   {
      ll temp = 500000004LL*A[i]%inf;
      temp = temp*(l[i]+1LL)%inf;
      temp = temp*(r[i]+1LL)%inf;
      temp = temp*(r[i]+l[i]+2LL)%inf;
      sum2 = (temp + sum2)%inf;
   }
   ll q = n;
   co = (co + ((166666668LL*n%inf)*(n+1)%inf)*(n+2)%inf)%inf;
   ll N = (((125000001LL*q)%inf)*(q+1)%inf)*(q*q%inf + q + 2)%inf;
   ll ma = 0;
   for(int i = 0; i < n;i++) ma = max(ma,A[i]);
   ll sum3 = (N - co + inf)*ma%inf;
   //cout<<"sum3 = "<<sum3<<"\n";
   return (sum1+sum2+sum3)%inf;
}

int main() 
{
    cin >> n;
    vector<ll> a(n);
    for(int a_i = 0; a_i < n; a_i++)
    {
       cin >> a[a_i];
    }
    ll result = solve(a);
    cout << result << endl;
    return 0;
}