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())
  x = 1
  y = 0
  while x**5 < n:
      y = n - x**5
      y = int(y)
      if x**5 + y**5 == n:
          print(x, -1 * y, sep=" ")
          break
      x += 1
  if x**5 + y**5 != n:
      i = 1
      while i <= 200:
          if n % i == 0:
              j = 0
              ok = False
              while (i + j) ** 5 - j**5 <= n:
                  if (i + j) ** 5 - j**5 == n:
                      print(i + j, j, sep=" ")
                      ok = True
                      break
                  j += 1
          i += 1
          if ok == True:
              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"}]