#!/bin/python

import sys

def max_transform(a):
    b = []
    for k in range(len(a)):
        for i in range(len(a)-k):
            j = i + k
            b.append(max(a[i:j+1]))
    return b

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

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