#include<bits/stdc++.h>
using namespace std;
#define db(x){if(cond)cerr<<__LINE__<<" "<<#x<<" " <<x<<endl;}
#define rep(i,b)for(__int128 i=(0);i<(b);++i)
#define fo(i,a,b)for(__int128 i=(a);i<=(b);++i)
#define ford(i,a,b)for(__int128 i=(a);i>=(b);--i)
#define all(x) (x).begin(),(x).end()
#define vv vector
#define pb push_back
template<typename X>void MA(X&a,X b){a=max(a,b);}template<typename X>void MI(X&a,X b){a=min(a,b);}
template<typename X>void clr(X&x,int a){memset(x,a,sizeof(a));};typedef __int128 ll;typedef long double ld;
typedef array<ll,2>ll2;typedef array<ll,3>ll3;typedef vv<long long>vi;int cond=0,multi=0,gcj=0;

const int MAXA=(int)2e6;
const int MOD=1e9+7;

const int MAXN=4e5;

struct solver_t{
  ll SUM1[MAXN+2]={};
  ll SUM2[MAXN+2]={};
  long long N;
  vi A;
  vi pos[MAXA+2];
  void init(){
    fo(i,1,MAXN){
      SUM1[i]=SUM2[i]=0;
      SUM1[i]=(SUM1[i-1]+((ll)i)*(i+1)/2);

      if(i>=2)SUM2[i]=SUM2[i-2];
      SUM2[i]=(SUM2[i]+((ll)i)*(i+1)/2);
    }
  }

  vi f(vi in){
    vi out;
    fo(k,0,(int)in.size()-1){
      fo(p,0,(int)in.size()-1-k){
        ll max_val=0;
        fo(i,0,k)max_val=max((long long)max_val,(long long)in[p+i]);
        out.pb(max_val);
      }
    }
    db(out.size());

    return out;
  }
  ll brute(){
    map<int,int>target_cnt;
    ll sol=0;
    vi f2=f(f(A));
    for(int i:f2)target_cnt[i]++;
    for(auto iter:target_cnt)sol=(sol+(long long)iter.first * iter.second)%MOD;
    for(auto iter:target_cnt)db(iter.first<<" "<<iter.second);
    return sol;
  }
  void solve(){
    cin>>N;
    //N = 9;

    A=vi(N);
    rep(i,N)cin>>A[i];

    rep(i,N)pos[A[i]].pb(i);


    //ll expected=brute();

    map<int,ll2> odc;
    rep(i,N)odc[i]={{A[i],0}};
    odc[-1]=odc[N]={{(int)2e9,0}};
    long long maxA=-1;rep(i,N)maxA=max(maxA,A[i]);
    __int128 total_count=0;
    __int128 total_sum=0;
    fo(i,0,maxA-1){
      if(pos[i].size()==0)continue;
      deque<ll3> pozi;
      set<int>ppp;
      for(int p:pos[i])ppp.insert(p);

      if(odc[0][0]<=i)ppp.insert(0);
      auto last=odc.end();last--;last--;
      if(last->second[0]<=i)ppp.insert(last->first);

      for(int p:ppp){
        auto ptr=odc.find(p);
        if(ptr==odc.end())continue;
        while(ptr->second[0]<=i)ptr--;
        ptr++;
        int p1=ptr->first;
        ll sub_cnt=ptr->second[1];
        while(true){
          auto ptr2=ptr;ptr2++;

          if(ptr2->second[0]<=i){sub_cnt+=ptr2->second[1];odc.erase(ptr2->first);}
          else break;
        }
        ptr++;
        int p2=ptr->first;

        pozi.pb({{p1,p2,sub_cnt}});
      }
      //for(auto el:pozi)db(i<<" "<<el[0]<<" "<<el[1]);
      auto f2=[](ll v){return v*(v+1)/2;};
      if(pozi[0][0]==0&&pozi.back()[1]==N){
        auto le=pozi.front(),ri=pozi.back();
        pozi.pop_front(); pozi.pop_back();

        ll d1=le[1]-le[0],d2=ri[1]-ri[0];
        ll added = f2(d1);
        d1--;
        ll poprzedni=le[2]+ri[2];

        ll kroki=min(d1,d2);
        //d2 + d1
        //d2-kroki + d1-kroki

        // 1 2 3 ... max(d1,d2)-kroki-1
        added += SUM2[d1+d2];
        added -= SUM2[d1-kroki+d2-kroki];
        //db(added<<" "<<kroki);

        //added += SUM1[max(d1,d2)-kroki];
        added += SUM1[d1-kroki+d2-kroki];
        added -= poprzedni;
        //db(added<<" "<<SUM1[2]);

        total_count=(total_count+added);
        total_sum=(total_sum+i*added);

        odc[le[0]]={{i,poprzedni+added}};
        odc[ri[0]]={{i,0}};
      }
      for(auto el:pozi){
        ll dist=el[1]-el[0];
        ll added = (dist*(dist+1)*(dist+2)/6 - el[2]);

        total_count=(total_count+added);
        total_sum=(total_sum+i*added);

        odc[el[0]]={{i,(el[2]+added)}};
      }
      //db((ll)total_count)
    }
    __int128 N2=N*(N+1)/2;
    __int128 N3=N2*(N2+1)/2;

    total_sum+=maxA*((N3-total_count));
    //db((long long)total_sum<<" "<<(long long)expected);
    //assert(total_sum == expected);
    cout<<(long long)(total_sum%MOD)<<"\n";
  }
};

int main(int argc,char** argv){
  ios::sync_with_stdio(false),cin.tie(0),cond=argc>=2&&argv[1][0]=='q'?1<<30:0;
  cout.setf(ios::fixed),cout.precision(10);int t;if(multi||gcj)cin>>t;else t=1;
  srand(time(0));
  t=1;
  fo(i,1,t){
    solver_t *solver=new solver_t();
    solver->init();
    solver->solve();
    delete solver;
  }return 0;
}