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;

int i,j,k,l;
int x,y;
int a,b;
int N;

long long fiv(long long n)
{
	
	return n*n*n*n*n;
}

int main()
{
    //#ifndef ONLINE_JUDGE
    //  freopen("input.txt","r",stdin);
    //  freopen("output.txt","w",stdout);
    //#endif
	
	cin >> x;
	for (long long i = -200; i <= 200; i++)
	{
		for (long long j = -200; j <= 200; j++) 
		{
			if (fiv(i)-fiv(j)== x) 
			{
				cout << i << " " << j << endl;
				return 0;
			}
		}
	}
	

}