#!/bin/python3

import sys

def solve(A):
    b=[]
    for i in range(0,len(A)):
        for j in range(0,len(A)-i):
            k=i+j
            b.append(max(A[j:k+1]))
    return b
       

         
    #  Return the sum of S(S(A)) modulo 10^9+7.

if __name__ == "__main__":
    n = int(input().strip())
    A = list(map(int, input().strip().split(' ')))
    result = solve(A)
    final=solve(result)
    print(sum(final)%(7+10**9))