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++14 (GCC 5.4.1) (judge verdict: Accepted)

//This code was made by Chinese_zjc_.
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#define int long long
#define INF 0x3fffffffffffffff
using namespace std;
int x;
int _5(int now)
{
	return now*now*now*now*now;
}
signed main()
{
	std::ios::sync_with_stdio(false);
	cin>>x;
	for(int i=-200;i<=200;++i)
	{
		for(int j=-200;j<=200;++j)
		{
			if(_5(i)-_5(j)==x)
			{
				cout<<i<<' '<<j<<endl;
				return 0;
			}
		}
	}
	return 0;
}