#!/bin/python

import sys

def S(A):
    ret=[]
    for diff in range(len(A)):
        for start in range(len(A)-diff):
            ret.append(max(A[start:start+1+diff]))
    return ret

def solve(A):
    B=S(S(A))
    s=0
    for b in B:
        s=(s+b)%1000000007
    return s
    #  Return the sum of S(S(A)) modulo 10^9+7.

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