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 OCaml (4.10.0) (judge verdict: Accepted)

Scanf.scanf "%d" (fun x ->
    let check x i =
        let rec loop c =
            if c < -1000 then None else
                if c * c * c * c * c - (c - i) * (c - i) * (c - i) * (c - i) * (c - i) = x then Some (c, c - i)
                else loop (c - 1)
        in
        loop 1000
    in
    let rec loop i =
        if x mod i = 0 then (
            match check x i with
            | Some (a, b) -> Printf.printf "%d %d\n" a b
            | None -> loop (i + 1)
        ) else loop (i + 1)
    in
    loop 1
)