#!/bin/python3

import sys

def max_transform(arr):
  n= len(arr)
  return [max(arr[i:i+k+1]) for k in range(n) for i in range(n-k)]

def solve(arr):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    arr = max_transform(max_transform(arr))
    modulo_sum = 0
    for a in arr:
        modulo_sum += a if modulo_sum < (10**9 +7) else a%(10**9+7)
        modulo_sum %=  (10**9+7)
    return modulo_sum
        

if __name__ == "__main__":
    n = int(input())
    arr  = list(map(int,input().split()))

    result = solve(arr)
    print(result)