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;
using ll = long long;
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
/*int root5(ll n) {
    if (n == 1) return 1;

    int res = 0;

    while(res * res * res * res * res <= n) {
        res++;
    }

    return res-1;
}*/
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll A, B, X;
    cin >> X;
    /*int R = root5(X);
    //cout << R;
    ll F = binpow(R, 5);
    for(int i = 0; i < n; i--) {
        if (F - binpow())
    }*/

    for(int i = -70; i <= 70; i++) {
        for(int j = -70; j <= 70; j++) {
            if (binpow(i, 5)-binpow(j, 5) == X) {
                cout << i << " " << j;
                return 0;
            }
        }
    }
}