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<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x;
map<ll,ll> pos;
int main()
{
	scanf("%d",&x);
	for(ll i=1;i<=100;++i) pos[i*i*i*i*i]=i;
	ll i;
	for(i=0;i*i*i*i*i<=x;++i) {
		ll f=pos[x-i*i*i*i*i];
		if(f!=0) {
			printf("%d ",i);
			printf("%d",-f);
			return 0;
		}
	}
//	while(!pos[i*i*i*i*i-x]) ++i;
//	printf("%lld %lld",i,pos[i*i*i*i*i-x]);
	return 0;
}