#!/bin/python3

import sys

def max_transform(A):
    B = []
    n = len(A)
    for k in range(n):
        for i in range(n-k):
            j = i + k
            B.append(max(A[i:j+1]) % (10**9+7))
    return B

def S(A):
    return max_transform(A)

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    res = sum(S(S(A)))
    return res

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