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 PHP (7.4.4) (judge verdict: Wrong Answer)

<?php
$n = trim(fgets(STDIN));

$num = 100;
for ($i=0; $i < $num; $i++) { 
    for ($j=0; $j < $num; $j++) { 
        if((pow($i,5) + pow($j,5)) == $n){
            if (!$j == 0) {
                $j = $j * (-1);
            }
            echo  $i . " " . $j;
            return;
        }

        if((pow($i,5) - pow($j,5)) == $n){
            echo  $i . " " . $j;
            return;
        }
    }
}

return;


?>