#!/bin/python3

import sys

def solve(A):
    b=[]
    for k in range(len(A)):
        for i in range (len(A)-k):
            j=i+k+1
            b.append(max(A[i:j]))
    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(' ')))
    b = solve(A)
    result=solve(b)
    print(sum(result)%(pow(10,9)+7))