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)

var obj = init();
Main();
function nextInt(){return myconv(next(),1);}
function nextStrArray(){return myconv(next(),2);}//半角スペース分割
function nextIntArray(){return myconv(next(),4);}//半角スペース + 数値化
function nextCharArray(){return myconv(next(),6);}//1文字分割
function next(){return obj.next();}
function hasNext(){return obj.hasNext();}
function myin(){return require("fs").readFileSync("/dev/stdin", "utf8").trim().split("\n");}
function init(){
  var inputFile = myin();
  var returnObj = {
    "list" : inputFile, "index" : 0, "max" : inputFile.length,
    "hasNext" : function(){return (this.index < this.max);},
    "next" : function(){if(!this.hasNext()){throw "ArrayIndexOutOfBoundsException これ以上ないよ";}else{var returnInput = this.list[this.index];this.index++;return returnInput;}}
  };
  return returnObj;
}
function myout(t){console.log(t);}//標準出力
function myerr(t){console.error(t);}//標準エラー出力
//[no]要素の扱い。数値型
//不明値、異常時:引数そのまま返す　1:数値へ変換
//2:半角SPで分割 4:半角SPで分割し、数値配列へ
//6:1文字で分割  7:1文字で分割し、数値配列へ
//8:半角SPで結合 9:改行で結合 0:文字なしで結合
function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(" ");case 4:return i.split(" ").map(Number);case 6:return i.split("");case 7:return i.split("").map(Number);case 8:return i.join(" ");case 9:return i.join("\n");case 0:return i.join("");default:return i;}}catch(e){return i;}}
function Main(){
  		var X = nextInt();
	if(Math.pow(X,1/5) % 1 == 0){
		myout(Math.pow(X,1/5) + " " + 0);
		return;
	}
	var list = [];
	var minuslist = [];
	for(var i = 1; i < 10000; i++){
		var tmp = Math.pow(i,5);
		list.push(tmp);
		list.push(-1 * tmp);
	}
	for(var i = 0; i < list.length; i++){
		for(var j = 0; j < list.length; j++){
			if(list[i] == list[j] + X){
				var isMinus1 = false;
				var isMinus2 = false;
				if(list[i] < 0){
					list[i] = -list[i];
					isMinus1 = true;
				}
				if(list[j] < 0){
					list[j] = -list[j];
					isMinus2 = true;
				}
				list[i] = Math.pow(list[i], 1/5);
				list[j] = Math.pow(list[j], 1/5);
				if(isMinus1){
					list[i] = -list[i];
				}
				if(isMinus2){
					list[j] = -list[j];
				}
				myout(list[i] + " " + list[j]);
				return;
			}
		}
	}
}