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<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>

typedef long long ll;
inline void read(ll &T) {
	ll x=0;bool f=0;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=!f;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	T=f?-x:x;
}

ll x;

ll qpow(ll a,ll b) {
	ll ans=1,base=a;
	while(b) {
		if(b&1) ans=ans*base;
		base=base*base;
		b>>=1;
	}
	return ans;
}

int main() {
	read(x);
	for(ll i=-200;i<=200;++i) {
		for(ll j=-200;j<=200;++j) {
			if(qpow(i,5)-qpow(j,5)==x) {
				std::cout<<i<<" "<<j<<'\n';
				return 0;
			}
		}
	}
	return 0;
}