#include <bits/stdc++.h>

using namespace std;

vector<int> maxT(vector<int>& A) {
    vector<int> ans;
    ans.insert(ans.end(), A.begin(), A.end());
    for (int i = 0; i < A.size()-1; ++i) {
        for (int j = 0; j < A.size()-i-1; ++j) {
            A[j] = max(A[j], A[j+1]);
            ans.push_back(A[j]);
        }
    }
    return ans;
}

int solve(vector <int> A) {
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
    vector<int> st = maxT(A);
    vector<int> sst = maxT(st);
    int C = 1000000000 + 7;
    int ans = 0;
    for (int i = 0; i < sst.size(); ++i) {
        // cout << sst[i];
        ans += sst[i];
        ans %= C;
        
    }
    return ans;
}

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