#!/bin/python3

import sys
import math

def s(a):
    b = []
    h = 0
    l = len(a)
    for k in range(l):
        for i in range(len(a)-k):
            j = i + k
            f = max(a[i:j+1])
            b.append(f)
            h = (h + f) % (math.pow(10,9)+7)
    b.append(h)
    return b

def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    a = s(A)
    a = s(a[0:len(a)-1])
    return int(a[len(a)-1])
    
    
    

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