#!/bin/python3

import sys

m = 1000000007

def max_transform(arr):
    res = []
    l = len(arr)
    for k in range(l):
        for i in range(l - k):
            j = i + k
            res.append(max(arr[i:j+1]) % m)
    return res

def solve(A):
    return (sum(max_transform(max_transform(A))) % m)

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