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: # ABC094D - Binomial Coefficients (ARC095D)
  from bisect import bisect_left as bs
  
  
  def main():
      # pascal's triangle := mid area (nCn/2) is the biggest -> bisect
      N = int(input())
      A = sorted(map(int, input().split()))
      if N == 2:
          print(A[1], A[0])
          return
      n, idx = A[-1], bs(A[:-1], A[-1] // 2)
      cand = [abs(A[i] - n / 2), A[i] for i in (idx - 1, idx, idx + 1)]
      r = min(cand)[1]
      print(n, r)
  
  
  if __name__ == "__main__":
      main()
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"}]