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: Time Limit Exceeded)

function main(input) {
  const x = parseInt(input[0]);
  let power5 = [];
  const width = ((x<100)?x:Math.floor(x/5));

  for(let i=-width;i<width;i++){
    power5[i+width]=i*i*i*i*i;
  }
  let judge = false;
  for(let i=-width;i<width;i++){
    for(let j=-width;j<width;j++){
      if((power5[i+width]-power5[j+width])===x){
        console.log(i + " " + j);
        judge = true;
        break;
      }
    }
    if(judge){
      break;
    }
  }
}
main(require('fs').readFileSync('/dev/stdin', 'utf8').trim().split("\n"));