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: Accepted)

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int x,i,j,flag;
	int a[2005];
	scanf("%d",&x);
	flag=0;
	if(x==1){
		printf("1 0");
		return 0;
	}
	for(i=-1000;i<=1000;i++){
		
		a[i+1000]=i*i*i*i*i;
	}
	for(i=0;i<2000;i++)
	{
		for(j=0;j<2000;j++)
		{
			if(a[i]-a[j]==x)
			{
				printf("%d %d",i-1000,j-1000);
				return 0;
			}
		}
	}
	return 0;
}