output_description: The output consists of two lines. The first line contains a_1, a_2, ..., a_N
  seperated by a space. The second line contains b_1, b_2, ..., b_N seperated by
  a space.
  
  It can be shown that there always exists a solution for any input satisfying
  the constraints.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      p_1 p_2 ... p_N
attempt: a = int(input())
  x = list(map(float, input().split()))
  m = max(x)
  M = m / 2
  t = 0
  s = float("INF")
  for i in x:
      # print(s,abs(M-i),i,M)
      if s >= abs(M - i):
          s = min(s, abs(M - i))
          t = i
  print(str(int(m)) + " " + str(int(t)))
  
problem_description: Statement
  
  You are given a permutation p of the set {1, 2, ..., N}. Please construct two
  sequences of positive integers a_1, a_2, ..., a_N and b_1, b_2, ..., b_N
  satisfying the following conditions:
  
    * 1 \leq a_i, b_i \leq 10^9 for all i
    * a_1 < a_2 < ... < a_N
    * b_1 > b_2 > ... > b_N
    * a_{p_1}+b_{p_1} < a_{p_2}+b_{p_2} < ... < a_{p_N}+b_{p_N}
samples: [{"input": "2\n    1 2", "output": "1 4\n    5 4\n    \n\na_1 + b_1 = 6 and a_2 + b_2 = 8. So this output satisfies all conditions.\n\n* * *"}, {"input": "3\n    3 2 1", "output": "1 2 3\n    5 3 1\n    \n\n* * *"}, {"input": "3\n    2 3 1", "output": "5 10 100\n    100 10 1"}]