#!/bin/python

import sys

def solve(A):
    B=[]
    for k in range(len(A)):
        for i in range(len(A)-k):
            B.append(max(A[i:i+k+1])%1000000007)
    return B
    #  Return the length of the longest possible sequence of moves modulo 10^9+7.

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(int, raw_input().strip().split(' '))
    result1 = solve(a)
    result2 = solve(result1)
    print sum(result2)