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 Main(input) {
    input = input.trim();    
    X = parseInt(input);


    const array = []

    for (var i = 0; i < 40000; i++) {
        array.push(Math.pow(i, 5))
    }

    var A = 0;
    var B = 0;

    var breakFlag = false;
    for (var i = 0; i < array.length; i++) {
        for (var j = 0; j < array.length; j++) {
            if (array[i] + array[j] == X) {
                A = i;
                B = j;
                breakFlag = true;
                break;
            }
            if (array[i] - array[j] == X) {
                A = i;
                B = -j;
                breakFlag = true;
                break;
            }
            if (-array[i] + array[j] == X) {
                A = -i;
                B = j;
                breakFlag = true;
                break;
            }
            if (-array[i] - array[j] == X) {
                A = -i;
                B = -j;
                breakFlag = true;
                break;
            }
        }
        if (breakFlag) break;
    }

    console.log(A + " " + B)

}

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