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<Integer> arrB = _calculateMaxTransform(A);
        int[] newA = new int[arrB.size()];
        for (int ind = 0; ind < arrB.size(); ind++)
        {
            newA[ind] = arrB.get(ind);
        }

        ArrayList<Integer> finalB = _calculateMaxTransform(newA);
        return _sumOutput(finalB);
    }

    private static int _sumOutput(ArrayList<Integer> finalB)
    {
        int sum =0;
        for (int num: finalB)
        {
            sum = sum + num;
        }
        return (int) (sum % (Math.pow(10,9) + 7));
    }

    private static ArrayList<Integer> _calculateMaxTransform(int[] arrA)
    {
        ArrayList<Integer> output = new ArrayList<>();
        for (int k = 0; k < arrA.length; k ++)
        {
            for (int i = 0; i < (arrA.length - k); i++)
            {
                output.add(_findMax(arrA, i, (i+k)));
            }
        }
        return output;
    }

    private static Integer _findMax(int[] arrA, int li, int hi)
    {
        int max = 0;
        for (int index = li; index <= hi; index ++)
        {
            if (arrA[index] > max)
            {
                max = arrA[index];
            }
        }
        return 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();
    }
}