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> 
#include<math.h>

int main() {
	int x,a,b,t;
	scanf("%d",&x);
	for(double i = pow(x,0.2);i > 0;i --) {
		int j = (int)i;
		if(x % j == 0) {
			t = j;
			break;
		}
	} 
	for(int i = 1;i < 100;i ++) {
		if(pow(i,5) - pow(i-t,5) == x) {
			a = i;
			b = i - t;
			break;
		}
	}
	if(a == 0) {
		for(int j = 1;j <= pow(x,0.5);j ++) {
			if(x % j == 0) {
				t = j;
				for(int i = 1;i < 100;i ++) {
					if(pow(i,5) + pow(i-t,5) == x) {
						a = i;
						b = t - i;
						goto here;
					}
				}
			}
			
		} 
		
	}
	here:
	printf("%d %d",a,b);
}