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) {
  input = input.trim();
  var N = parseInt(input, 10);
  var maxN = 0;
  var n = 10;
  var A = 0;
  var B = 0;
  while (true) {
    n_1 = Math.pow(n, 5);
    n_2 = Math.pow(n - 1, 5);
    if (n_1 - n_2 > Math.pow(10, 9)) {
      maxN = n + 1;
      break;
    }
    n++;
  }

  for (var i = -maxN; i < maxN; i++) {
    for (var j = -maxN; j < maxN; j++) {
      var a = Math.pow(i, 5);
      var b = Math.pow(j, 5);
      if (a - b === N) {
        A = i;
        B = j;
        console.log(A, B);
        return;
      }
    }
  }
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));