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<cstdio>
const int N = 1e5;
int n, a, b, c;
int vis[N];
int main() {
	return 0;
}
*/
#include<cstdio>
#include<cmath>
const int N = 120;
int x, a[1000];
int main() {
	scanf("%d", &x);
	for (int i = -120; i <= 120; i++) a[i + N] = i * i * i * i * i;
	for (int i = -120; i <= 120; i++)
		for (int j = -120; j <= 120; j++)
			if (a[i + N] - a[j + N] == x) return printf("%d %d", i, j), 0;
	return 0;
}