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())
  d = [[0 for i in range(110)] for j in range(110)]
  e = [[0 for i in range(110)] for j in range(110)]
  for i in range(110):
      d[0][i] = i**5
      d[i][0] = i**5
  for i in range(1, 110):
      for j in range(1, 110):
          d[i][j] = d[0][j] - d[i][0]
          e[i][j] = d[0][j] + d[i][0]
  for m in range(110):
      if x in d[m]:
          print(d[m].index(x), m)
          break
      elif x in e[m]:
          print(e[m].index(x), -m)
          break
  
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"}]