#include <bits/stdc++.h>

using namespace std;

int maxm(int vec[], int size){
    int maxi = vec[0];
    int ct = 0;
    while (0 <= ct && ct <= (size-1)) {
        if (maxi < vec[ct]) { maxi = vec[ct] ;};
        ct++;
    }
    return maxi;
}

int subarr(int* A[], int i, int j) {
    int subarraylen = j-i+1;
    int sub_array[subarraylen];
    for (int k=0; k<subarraylen; k++) {
        sub_array[k] = *A[i+k];
    }
    return *sub_array;
}

int siz = 0;

int S(int* A[] , int length ){
    int len = length;
    int bindex = 0;
    int B[100000]={0};
    for (int k = 0; k<= len-1; k++) {
        for (int i = 0; i<= len-k-1; i++) {
            int j = i+k;
            B[bindex] = maxm( subarr(A,i,j) );
            bindex++;
        }
    }
    siz = siz + bindex + 1;
    return *B;
}


int solve(int A[], int n) {
    //  Return the sum of S(S(A)) modulo 10^9+7.
    long total = 0;
    for (int w=0; w<siz; w++) {
        total = total + S(*A,n)[w];
//        total = total + S(S(*A,n))[w]
    }
    return total % 10^9+7;
}
int n;
int main() {
    cin >> n;
    int a[n];
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    int result = solve(a,n);
    cout << result << endl;
    return 0;
}