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.
        int[] a2 = solve2(a);
        int[] a3 = solve2(a2);
        long result = 0;
        for(int s : a3) {
            result +=s;
            result %= 1000000007;
        }
        return (int)result;
    }

    static int[] solve2(int[] a) {
        int[] result  = Arrays.copyOf(a, a.length * (a.length + 1) / 2);
        int count = a.length;
        for(int i = 1; i<a.length; i++) {
            for(int j = 0; j<a.length - i; j++) {
                result[count] = Math.max(result[count - a.length + i], result[count-a.length+i-1]);
                count++;
            }
        }
//        System.out.println(Arrays.toString(result));
        return result;
    }

    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();
    }
}