#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

vector<int> generate(vector<int> A){
  vector<int> B;
  for(int k = 0; k < A.size(); k++){
    for(int i = 0; i < (A.size()-k); i++){
      int j = i+k;
//      cout << i << " " << j << endl;
      int maxi = A[i];
      for(int a = i+1; a <= j; a++){
        maxi = max(maxi, A[a]);
      }
      B.push_back(maxi);
    }
  }
  return B;
}

int main() {
  int n;
  while(cin >> n){
    vector<int> v(n, 0);
    for(int i = 0; i < n; i++){
      cin >> v[i];
    }
    v = generate(generate(v));
    long long sum = 0; 
    for(int elem: v){
      sum += elem;
    }
    sum %= 1000000007;
    cout << sum << endl;
  }
  return 0;
}