import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    private static final long MOD = 1000000007;

    public static void main(String[] args) throws IOException
    {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++)
            a[i] = in.nextInt();

        List<Integer> b = new ArrayList<>();
        for (int k = 0; k < n; k++)
            for (int i = 0; i < n - k; i++)
            {
                int j = i + k;
                int max = 0;
                for (int m = i; m <= j; m++)
                    max = Math.max(max, a[m]);
                b.add(max);
            }
        
        long res = 0;
        for (int k = 0; k < b.size(); k++)
            for (int i = 0; i < b.size() - k; i++)
            {
                int j = i + k;
                int max = 0;
                for (int m = i; m <= j; m++)
                    max = Math.max(max, b.get(m));
                res += max;
                res = res % MOD;
            }

        System.out.println(res);

        in.close();
    }

}