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 Common Lisp (SBCL 2.0.3) (judge verdict: Runtime Error)

(defun calc (x)
  (loop for i from 1 to (floor (expt x (/ 1 5)))
        if (= x
              (+ (expt i 5)
                 (expt (floor (expt (- x (expt i 5))
                                    (/ 1 5)))
                       5)))
        do (loop-finish)
        finally (return (list i 
                              (floor (expt (- x (expt i 5))
                                           (/ 1 5)))))))

(let* ((x (read))
       (pair (calc x)))
      (format t "~A ~A" (car pair) (- (cadr pair))))