Problem:
Score : 400 points

Problem 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.

Constraints

1 \leq X \leq 10^9

X is an integer.

There exists a pair of integers (A, B) satisfying the condition in Problem Statement.

Input

Input is given from Standard Input in the following format:

X

Output

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

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in Haskell (GHC 8.8.3) (judge verdict: Runtime Error)

import Text.Printf

main :: IO ()
main = do
  x <- readLn
  let (a, b) = solve x
  printf "%d %d\n" a b

solve :: Int -> (Int, Int)
solve 0 = (0, 0)
solve 1 = (1, 0)
solve 2 = (1, -1)
solve x
  | x < 0       = let (a, b) = solve (-x) in (b, a)
  | y == yb ^ 5 = if x < xb ^ 5 then (xb, yb) else (xb, -yb)
  where
    xb = round $ fromIntegral x ** 0.2
    y  = abs $ x - xb ^ 5
    yb = round $ fromIntegral y ** 0.2