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)

"use strict";
var input = require("fs").readFileSync("/dev/stdin", "utf8");
var cin = input.trim().split(/ |\n/), cid = 0;

function main() {
    let X = +cin.shift();
    let s = 0;
    while (s <= 200) {
        for (let a = 0; a <= s; a++) {
            let b = s - a;
            let ma = -a;
            let mb = -b;
            if (a ** 5 - b ** 5 == X) {
                console.log(a, b);
                return;
            }
            if (a ** 5 - mb ** 5 == X) {
                console.log(a, mb);
                return;
            }
            if (ma ** 5 - b ** 5 == X) {
                console.log(ma, b);
                return;
            }
            if (ma ** 5 - mb ** 5 == X) {
                console.log(ma, mb);
                return;
            }
        }
        s++;
    }
}
main();