#!/bin/python

import sys

def sa(a):
    n = len(a)
    l = []
    for k in range(0, n):
        for i in range(0, n-k):
            j = i+k
            l += [max(a[i:j+1])]
    return l

def sum(a):
    n = len(a)
    sum = 0
    for i in range(0, n):
        sum = (sum + a[i]) % (1000000007)
    return sum

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

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