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) {
    input = input.trim();
    // input = input.split("\n")
    // input = input.map(e => e.split(" ").map(f => parseInt(f)))
    X = parseInt(input);

    var A = 0;
    var B2 = 0;
    for(var B=-100;B<100000000;B++){
        A = Math.pow(X+Math.pow(B,5),1/5);        
        if(A-Math.floor(A)==0){
            B2 = B;
            break;
        }
    }

    console.log(A+" "+B2)

}

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