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
$X = (int)trim(fgets(STDIN));
//$S = trim(fgets(STDIN));
//list($N,$M) = array_map('intval',explode(" ",trim(fgets(STDIN))));
//$s = trim(fgets(STDIN));
//$H = array_map('intval',explode(" ",trim(fgets(STDIN))));

for($i=0;$i<1000;$i++) {
  $a[] = $i**5;
}

for($i=0;$i<1000;$i++) {
  for($j=$i+1;$j<1000-1;$j++) {
    if ($a[$j]-$a[$i]==$X) {
      printf("%d %d\n",$j,$i);
      break;
    }
    if (($a[$j]*-1)-$a[$i]==$X) {
      printf("%d %d\n",-$j,$i);
      break;
    }
    if ($a[$j]-$a[$i]*-1==$X) {
      printf("%d %d\n",$j,-$i);
      break;
    }
  }
}