#!/bin/python3

import sys

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    M = 10**9+7
    tmp = []
    b = []
    for k in range(len(A)):
        for i in range(len(A)-k):
            j = i+k
            tmp.append(max(A[i:j+1]))
    for k in range(len(tmp)):
        for i in range(len(tmp)-k):
            j = i+k
            b.append(max(tmp[i:j+1]))
    ans = 0
    for i in range(len(b)):
        ans = (ans+b[i])%M
    return ans    
            

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(a)
    print(result)