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 <bits/stdc++.h>
using namespace std;
int main() {
	int x, c = -404, cnt = 0, tmp;
	long int a = -404, b = -404;
	vector<int> y = {1};
	cin >> x;
	for (int i = 2; i < pow(x,0.5); i++) {
		if (x % i == 0) {
			y.push_back(i);
			cnt++;
			if (cnt > 4) {
				break;
			}
		}
	}
	tmp = y.size();
	for (int i = 0; i < tmp; i++) {
		y.push_back(x / y.at(i));
	}
	for (int j = 0; j < int(y.size()); j++) {
		for (int i = 0; i < 100; i++) {
			c = pow(i + y.at(j), 5) - pow(i, 5);
			if (c == x) {
				a = i + y.at(j);
				b = i;
				break;
			}
			c = pow(i, 5) - pow(i - y.at(j), 5);
			if (c == x) {
				a = i;
				b = i - y.at(j);
				break;
			}
		}
	}
	cout << a << ' ' << b << endl;
}