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: Wrong Answer)

const Main = (input) => {
  const X = parseInt(input.trim())

  let result = ''

  for (let i = 0; i <= X; i++) {
    const A = Math.exp(Math.log(i) / 5)
    if (A - Math.floor(A) === 0) {
      const j = X - i
      const B = Math.exp(Math.log(j) / 5)
      if (B - Math.floor(B) === 0) {
        if (Math.pow(A, 5) - Math.pow(B, 5) === X) {
          result = A + ' ' + B
        } else if (Math.pow(A, 5) - Math.pow(-1 * B, 5) === X) {
          result = A + ' -' + B
        }
      }
    }
  }

  console.log(result)
  return result
}

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