output_description: Print A and B, with space in between. If there are multiple pairs of integers
  (A, B) satisfying the condition, you may print any of them.
  
      
      
      A B
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X
attempt: import math
  
  x = int(input())
  y = math.pow(abs(x), 1.0 / 5.0)
  a = math.ceil(y)
  b1 = round(math.pow(abs(a ^ 5 - x), 1 / 5))
  b2 = round(math.pow(abs((a - 1) ^ 5 - x), 1 / 5))
  if a ^ 5 - b1 ^ 5 == x:
      print(a, b1)
  elif a ^ 5 - b1 ^ 5 == -x:
      print(b1, a)
  elif (a - 1) ^ 5 + b2 ^ 5 == x:
      print(a - 1, -b2)
  else:
      print(-b2, a - 1)
  
problem_description: Statement
  
  Give a pair of integers (A, B) such that A^5-B^5 = X. It is guaranteed that
  there exists such a pair for the given integer X.
samples: [{"input": "33", "output": "2 -1\n    \n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\n* * *"}, {"input": "1", "output": "0 -1"}]