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: Time Limit Exceeded)

#include<stdio.h>
long long int keisan(long long int a,long long int b){
	return a*a*a*a+a*a*a*b+a*a*b*b+a*b*b*b+b*b*b*b;
}
int main(void){
	long long int x,a,b;
	int temp=0;
	scanf("%lld",&x);
	do{
		for(long long int i=1;i<x+1;i++){
			if(x%i==0){
				for(long long int j=0;j<i;j++){
					a=j;
					b=j-i;
					if((long long int)(a-b)*keisan(a,b)==x){
						temp=1;
						break;
					}
				}
			}
			if(temp==1){
				break;
			}
		}
	}while(temp==0);
	printf("%lld %lld",a,b);
}