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<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

int main() {
    int X, ansa = -1, ansb = -1;
    cin >> X;
    for (int a = -121; a <= 121; a++) {
        for (int b = -121; b <= 121; b++) {
            if (a * a * a * a * a - b * b * b * b * b == X) {
                ansa = a, ansb = b;
                break;
            }
        }
    }
    cout << ansa << " " << ansb << endl;
    return 0;
}