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 JavaScript (Node.js 12.16.1) (judge verdict: Accepted)

function main(input) {
  var x = parseInt(input.split("\n")[0], 10);

  var hoge = [];
  for (var i = 0; i < 150; i++) {
    hoge.push(Math.pow(i, 5));
  }
  var fuga = hoge.concat();

  for (var i = 0; i < hoge.length; i++) {
    for (var j = 0; j < fuga.length; j++) {
      var a5 = hoge[i];
      var b5 = fuga[j];
      
      if (a5 - b5 == x) {
        console.log(i + " " + j);
        return;
      }

      b5 = b5 * -1;
      if (a5 - b5 == x) {
        console.log(i + " " + "-" + j);
        return;
      }
    }
  }
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));