#include<bits/stdc++.h>
using namespace std;
 int n;
struct node
{
   int minimum;
   int maximum;
};
int getMid(int s, int e) {  return s + (e -s)/2;  }
struct node MaxMinUntill(struct node *st, int ss, int se, int qs,
                         int qe, int index)
{
    struct node tmp,left,right;
    if (qs <= ss && qe >= se)
        return st[index];
    if (se < qs || ss > qe)
    {
       tmp.minimum = INT_MAX;
       tmp.maximum = INT_MIN;
       return tmp;
     }
    int mid = getMid(ss, se);
    left = MaxMinUntill(st, ss, mid, qs, qe, 2*index+1);
    right = MaxMinUntill(st, mid+1, se, qs, qe, 2*index+2);
    tmp.minimum = min(left.minimum, right.minimum);
    tmp.maximum = max(left.maximum, right.maximum);
    return tmp;
}
struct node MaxMin(struct node *st, int n, int qs, int qe)
{
    struct node tmp;
    if (qs < 0 || qe > n-1 || qs > qe)
    {
        printf("Invalid Input");
        tmp.minimum = INT_MIN;
        tmp.minimum = INT_MAX;
        return tmp;
    }
     return MaxMinUntill(st, 0, n-1, qs, qe, 0);
}
void constructSTUtil(int arr[], int ss, int se, struct node *st,
                     int si)
{
    if (ss == se)
    {
        st[si].minimum = arr[ss];
        st[si].maximum = arr[ss];
        return ;
    }
    int mid = getMid(ss, se);
    constructSTUtil(arr, ss, mid, st, si*2+1);
    constructSTUtil(arr, mid+1, se, st, si*2+2);

    st[si].minimum = min(st[si*2+1].minimum, st[si*2+2].minimum);
    st[si].maximum = max(st[si*2+1].maximum, st[si*2+2].maximum);
}
struct node *constructST(int arr[], int n)
{
    int x = (int)(ceil(log2(n)));
    int max_size = 2*(int)pow(2, x) - 1;
    struct node *st = new struct node[max_size];
    constructSTUtil(arr, 0, n-1, st, 0);
    return st;
}
int main()
{
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
    cin>>arr[i];
    }
    vector <int> v;
    struct node *st = constructST(arr, n);
    for(int k=1;k<n;k++)
    {
        for(int i=0;i<n-k;i++)
        {
            int j=i+k;
           // cout<<"i="<<i<<" j="<<j<<endl;
            struct node result=MaxMin(st,n,i,j);
        v.push_back(result.maximum);
        }
    }
    long long int ans=0;
    long long int mod=1000000007;
    int p=v.size();
    int f[n+p];
    for(int i=0;i<n;i++)
    {
        ans=ans+arr[i];
        ans%=mod;
        f[i]=arr[i];
    }
for(int i=0;i<p;i++)
    {

        ans=ans+v[i];
        ans%=mod;
        f[n+i]=v[i];
    }
    struct node *ft = constructST(f, n+p);
    for(int k=1;k<n+p;k++)
    {
        for(int i=0;i<n+p-k;i++)
        {

            int j=i+k;
                       // cout<<"i="<<i<<" j="<<j<<endl;
            struct node result=MaxMin(ft,n+p,i,j);

        ans=ans+result.maximum;
        ans%=mod;
        }
    }
    cout<<ans;
    return 0;
}