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 Perl (5.26.1) (judge verdict: Wrong Answer)

my ($n) = split(/\s+/, <>);

for my $a (0..$n) {
    my $a5 = $a * $a * $a * $a * $a;
    my $b;
    if ($a5-$n>0) {
	$b = exp(log($a5-$n)/5);
    } elsif ($a5-$n<0) {
	$b = -exp(log(-$a5+$n)/5);
    } else {
	$b = 0;
    }
    $b = int($b);
    my $b5 = $b * $b * $b * $b * $b;
    if ($a5-$b5==$n) {
	print $a, " ", $b, "\n";
	exit;
    }
}