#!/bin/python3

import sys
M = 1000000007
def solve(A):
    #  Return the sum of S(S(A)) modulo 10^9+7.
    B = []
    k = 0
    while k  <= len(A)-1 :
        i = 0
        while i  <= len(A)-k-1 :
            j = i+k
            B.append((max(A[i:j+1]))%(M))
            i += 1
        k += 1    
    return B        

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