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<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define x first
#define y second
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'


int main()
{
	map<ll,int> mp;
	ll x;
	cin>>x;
	for(ll i=-3981;i<=3981;i++){
		ll val=i*i*i*i*i;
		mp[val]=i;
	}
	for(ll i=-3981;i<=3981;i++){
		ll val=i*i*i*i*i;
		ll xx=x+val;
		if(mp.find(xx)!=mp.end()){
			cout<<mp[xx]<<' '<<i<<endl;
			return 0;
		}
	}
	return 0;
}