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: Runtime Error)


const min = -100;
const max = 100;
const m = {};
for (let i = min; i <= max; i++) {
    m[i] = i**5;
}
// console.log(m);

const ans = {};
for (let i = min; i <= max; i++) {
    for (let k = min; k <= max; k++) {
        ans[m[i] - m[k]] = [i, k];
    }
}

const lines = require('fs').readFileSync('/dev/stdin', 'utf8').split('\n');
const X = +lines[0];
console.log(`${ans[X][0]} ${ans[X][1]}`);