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: import math
  n = int(input())
  a = list(map(int,input().split()))
  a = sorted(a, reverse = True)
  f = True
  m = 0
  hikaku = -1 
  syutu = 0
  i = 1
  while f and i <= n - 1:
      if a[0]//2 == a[i] or a[0]//2 == a[i] + 1:
          f = False
          m = a[i]
      else:
          i += 1
  
  if f == True:
      for i in range(n):
          answer = 1
          syutu = a[i + 1]
          answer = int(math.factorial(a[0]) / (math.factorial(a[i + 1]) * math.factorial(a[0] - m + 1))
          if hikaku < = answer:
              
              hikaku = answer
              m = syutu
          
  print(a[0], syutu)
  
          
          
  
  
  
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"}]