#!/bin/python

import sys

def S(A):
    B = []
    for k in xrange(len(A)):
        for i in xrange(len(A)-k):
            B.append(max(A[i:i+k+1]))
    return B

def solve(A):
    return sum(S(S(A))) % (10**9+7)

if __name__ == "__main__":
    n = int(raw_input().strip())
    A = map(int, raw_input().strip().split(' '))
    result = solve(A)
    print result