output_description: Print a_i and a_j that you selected, with a space in between.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      n
      a_1 a_2 ... a_n
attempt: # -*- coding: utf-8 -*-
  
  # input
  N = int(input())
  A = list(map(int, input().split()))
  
  
  # solve
  # def comb(n, r):
  #     if n < 0 or r < 0 or n < r:
  #         return 0
  #     elif n == 0 or r == 0:
  #         return 1
  #     return comb(n-1, r-1) + comb(n-1, r)
  
  # def comb(n, r):
  #     if n == 0 or r == 0: return 1
  #     return comb(n, r-1) * (n-r+1) / r
  
  
  # A = sorted(A)[::-1]
  # max_num = 0
  # pair = []
  # for i in range(len(A)-1):
  #     for j in range(i, len(A), 1):
  #         if (i == j):
  #             continue
  #         if (max_num < comb(A[i], A[j])):
  #             max_num = comb(A[i], A[j])
  #             pair = []
  #             pair.append(A[i])
  #             pair.append(A[j])
  
  # print(pair[0], pair[1])
  
  print(0, 0)
  
problem_description: Statement
  
  Let {\rm comb}(n,r) be the number of ways to choose r objects from among n
  objects, disregarding order. From n non-negative integers a_1, a_2, ..., a_n,
  select two numbers a_i > a_j so that {\rm comb}(a_i,a_j) is maximized. If
  there are multiple pairs that maximize the value, any of them is accepted.
samples: [{"input": "5\n    6 9 4 2 11", "output": "11 6\n    \n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n  * \\rm{comb}(4,2)=6\n  * \\rm{comb}(6,2)=15\n  * \\rm{comb}(6,4)=15\n  * \\rm{comb}(9,2)=36\n  * \\rm{comb}(9,4)=126\n  * \\rm{comb}(9,6)=84\n  * \\rm{comb}(11,2)=55\n  * \\rm{comb}(11,4)=330\n  * \\rm{comb}(11,6)=462\n  * \\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\n* * *"}, {"input": "2\n    100 0", "output": "100 0"}]