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: X = int(input())
  five = [0] * 64
  five_inv = [0] * 64
  for i in range(64):
      five[i] = i**5
      five_inv[i] = -five[i]
  
  
  def check(x):
      for i in range(64):
          if X + five[i] in five:
              B = i
              A = five.index(five[i] + X)
              break
          elif X - five[i] in five:
              B = -i
              A = five.index(-five[i] + X)
              break
          elif X + five[i] in five_inv:
              B = i
              A = -five_inv.index(five[i] + X)
              break
          elif X - five[i] in five_inv:
              B = -i
              A = -five_inv.index(-five[i] + X)
              break
      return "{} {}".format(A, B)
  
  
  print(check(X))
  
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"}]