import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static int solve(int[] A) { // Return the sum of S(S(A)) modulo 10^9+7. ArrayList arrList = new ArrayList(); int len = A.length; //for(int i = 0 ; i < len ; i++) //arrList.add(new Integer(A[i])); for(int k = 0 ; k < len ; k++){ int temp_len = len - k; for(int i = 0 ; i < temp_len ; i++){ int j = i + k; Integer b = max(A, i , j); arrList.add(b); } } int[] bArr = new int[arrList.size()]; int counter = 0; for(int temp : arrList){ bArr[counter] = arrList.get(counter); counter++; } arrList.clear(); len = bArr.length; for(int k = 0 ; k < len ; k++){ int temp_len = len - k; for(int i = 0 ; i < temp_len ; i++){ int j = i + k; Integer b = max(bArr, i , j); arrList.add(b); } } int sum = 0, MOD = 1000000007; for(int temp : arrList){ sum = ((sum % MOD) + (temp % MOD)) % MOD ; // System.out.print(temp+" "); } return sum; } static Integer max(int []a, int start, int end){ int max = a[start]; for(int i = start + 1 ; i <= end ; i++) if(a[i] > max) max = a[i]; return (new Integer(max)); } public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] a = new int[n]; for(int a_i = 0; a_i < n; a_i++){ a[a_i] = in.nextInt(); } int result = solve(a); System.out.println(result); in.close(); } }