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)

{-# LANGUAGE TypeApplications #-}
module Main where
import qualified Data.Vector.Unboxed           as VU
import qualified Data.Vector.Unboxed.Mutable   as VUM
main :: IO ()
main = do
  x <- readLn @Int
  let (a, b) = solver x
  putStrLn $ unwords [show a, show b]

solver :: Int -> (Int, Int)
solver x =
  let nums  = [0 .. 99]
      fives = VU.map (^ 5) $ VU.fromListN 100 [0 .. 99]
  in  fst . head $ filter
        ((== x) . snd)
        [ ((a, -b), fives VU.! a + fives VU.! b) | a <- nums, b <- nums ]