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

#include <iostream>
#include <queue>
#include <list>
#include <vector>

using namespace std;

#define MIN(x, y) x<y?x:y
#define MAX(x, y) x<y?y:x
#define ABS(x, y) x<y?(y-x):(x-y)

#define MAX_VAL 64

typedef long long Long;

int main()
{
	Long a[MAX_VAL], x;

	cin>>x;

	int i, j;

	for(i=0 ; i<MAX_VAL ; i++){
		a[i] = i*i*i*i*i;
	}

	for(i=0 ; i<MAX_VAL ; i++) {
		for(j=0; j<MAX_VAL ; j++){
			if(a[i]-a[j]==x) {
				cout<<i<<" "<<j<<endl;
				return 0;
			}
		}
	}

	for(i=0 ; i<MAX_VAL ; i++) {
		for(j=0; j<MAX_VAL ; j++){
			if(a[i]+a[j]==x) {
				cout<<i<<" -"<<j<<endl;
				return 0;
			}
		}
	}

	return 0;
}