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: n = int(input())
  arr = []
  for i in range(1, int(pow(n, 1 / 2)) + 1):
      if n % i == 0:
          arr.append(i)
  res = []
  for i in range(len(arr)):
      for j in range(-arr[i] - 1, int(pow(n, 1 / 2) + 1)):
          if (j + arr[i]) ** 5 - j**5 == n:
              res = [j + arr[i], j]
              break
  print(*res)
  
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"}]