using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {

    static int solve(List<int> A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        int result = 0;
        
        List<int> sa = CreateList(A);
        List<int> ssa = CreateList(sa);
        
        for (int i=0; i<ssa.Count; ++i)
        {
            result += ssa[i];
        }
        
        return (result % 1000000007);  
    }

    static void Main(String[] args) {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] a_temp = Console.ReadLine().Split(' ');
        var a = Array.ConvertAll(a_temp,Int32.Parse).ToList();
        int result = solve(a);
        Console.WriteLine(result);
    }
    
    static List<int> CreateList(List<int> inputArray)
    {
        var result = new List<int>();
        
        for (int k=0; k < inputArray.Count; ++k)
        {
            for (int i=0; i < (inputArray.Count - k); ++i)
            {
                int j = i + k;
                result.Add(GetMax(i, j+1, inputArray));
            }            
        }
        
        return result;
        
    }
    
    static int GetMax(int start, int end, List<int> list)
    {
        int result = 0;
        for (int i=start; i<end; ++i)
        {
               if (list[i] > result)
                   result = list[i];
        }        
        return result;
    }
}