#!/bin/python

import sys
def max_transform(A):
    n = len(A)
    #A = sorted(A,reverse=True)
    B = list()
    if n == 0:
        return []
    for k in range(n):
        for i in range(n-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.
    
    max_t = max_transform(A)
    print(max_t)
    max_tt = max_transform(max_t)
    print(max_tt)
    s = sum(max_tt)%(10**9+7)
    
    return s

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