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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int fast(int a,int b){
	int ans=1;
	while(b>0){
		if(b&1) ans=a*ans;
		a=a*a;
		b=b/2;
	}
	return ans;
}
int main(){
	int x;
	int a=-100,b=-100;
	scanf("%d",&x);
	for(a=-100;a<=100;a++){
		for(b=-100;b<=100;b++){
			int y=fast(a,5)-fast(b,5);
			if(y==x) goto l;
		}
	}
	l:;
	printf("%d %d",a,b);
	return 0;
}