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: Accepted)

<?php
define('MAX', pow(10, 9));
$x = 0;
$a[0] = 0;
for ($i = 1; $i < PHP_INT_MAX; $i++) {
    $tmp = pow($i, 5);
    if ($tmp - $a[$i - 1] > MAX) {
        break;
    }
    $a[$i] = $tmp;
    $a[-$i] = -$tmp;
}

fscanf(STDIN, "%d", $N);
 
$cnt = count($a);
foreach ($a as $k1 => $v1) {
    foreach ($a as $k2 => $v2) {
        if ($v1 - $v2 === $N) {
            printf("%d %d", $k1, $k2);
            break 2;
        }
    }
}