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)

function D166(_input) {
    var lines = _input.split("\n");
    var x = lines.shift()*1;

    for (var i = 117; i > -118; i--) {
        for (var j = 116; j > -117; j--) {
            const fi = i*i*i*i*i;
            const fj = j*j*j*j*j;
            if (fi - fj === x) {
                console.log(`${i} ${j}`);
                return;
            }
        }
    }
}
D166(require("fs").readFileSync("/dev/stdin", "utf8"));