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: Wrong Answer)

#include<iostream>
using namespace std;

 long long cimi(long long x,int n){
 	long long result=1;
 	for(int i=1;i<=n;i++)
 		result*=x;
 	return result;
 }

int main(){
	long long n;
	cin>>n;
	for(long long i=-150;i<150;i++)
		for(long long j=-150;j<150;j++){
			if(cimi(i,5)+cimi(j,5)==n){
				cout<<i<<" "<<j<<endl;
				return 0;
			}
			
		}
}