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)

let x = Scanf.sscanf (read_line ()) "%d" @@ fun x -> x

let pow n a = Array.fold_left ( * ) 1 @@ Array.make a n

let () =
  for a = -200 to 200 do
    for b = -200 to 200 do
      if pow a 5 - pow b 5 = x then begin
        Printf.printf "%d %d\n" a b;
        exit 0
      end
    done
  done