#include <bits/stdc++.h>
using namespace std;
#define N 4001
int n , a[100000],b[N][N],x,y,z;
vector<pair<int,int> > sa;
int kq;
long long c[N][N];
int main(){
    cin >> n;

     for (int i=1;i<=n;i++) cin >> a[i];
     for (int i=n+1;i<=n*2;i++) a[i]=a[i-n];
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            b[i][j]=max(b[i][j-1],a[i+j-1]);
            c[i][j]=c[i][j-1]+b[i][j];
        }
    }
    for (int i=1;i<=n;i++)
    for (int j=1;j<=n-i+1;j++){
        sa.push_back({j,i+j-1});
    }
    long long  m=b[1][n];
    kq=0;
    int base = (int) (1e9+7);
    int r=0;
    for (int i=0;i<sa.size()-1;i++){
        if (r<=i) r=i;
        while (sa[r+1].second-sa[r+1].first== sa[r].second-sa[r].first) r++;
        while (!(sa[r+1].first <= sa[i].second && sa[i].second<= sa[r+1].second)) r++;

        x = sa[i].first;
        y = sa[i].second;
        z=  sa[r].second;
        kq=(kq+(c[x][n-x+1]-c[x][y-x]+base) % base) % base;
        if (z<y) {
            kq= (kq + (c[x][n-y+1+z]-c[x][n-y+1+1+y-x]+base) % base) %base;
        }
        kq = (kq + m*(sa.size()-1-r)) % base;
    }
     cout << (kq+m) % base;

    return 0;
}