#!/bin/python3

import sys

def solve(a):
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.
    return sum(max_transform(max_transform(a))) % 1000000007

def max_transform(array):
    b = []
    for k in range(len(array)):
        for i in range(len(array)-k):
            b.append(max(array[i:k+i+1]))
    return b
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = solve(a)
    print(result)