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 = abs(int(input()))
  size = 1000
  L = [i**5 for i in range(size)]
  if X == 0:
      print(0, 0)
  for l in range(size):
      for m in range(l + 1):
          if L[l] + L[m] == X:
              print(l, -m)
              exit(0)
          if L[l] - L[m] == X:
              print(l, m)
              exit(0)
  
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"}]