#!/bin/python3

#basic first submit

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

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