#!/bin/python

import sys
def solve(A):
        l=[]
        x=[]
        for k in range(0,len(A)):
            for i in range(0,len(A)-k):
                j=i+k
                l.append(max(A[i],A[j]))
        for y in range(0,len(l)):
            for f in range(0,len(l)-y):
                j=f+y
                x.append(max(l[f],l[j]))
               
        return sum(x)%((10**9)+7)
            #  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