#!/bin/python3

import sys

def solve(A):
    b = []
    maxa = 0
    sumS = 0
    flag = 0
    for k in range(0,len(A)):
        for i in range(0,len(A)-k):
            maxa=0
            j = i+k
            if(i<=j):
                for z in range(i,j+1):
                    maxa = max(maxa,A[z])
                b.append(maxa)
    if n == len(A):
        flag = 1
        b = solve(b)
    if flag == 0:
        return b
    for S in range(0,len(b)):
        sumS = sumS + (b[S] % ((10^9)+7))
    return sumS

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