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 <bits/stdc++.h>

using namespace std;

using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;

int main() {
    ll n, m, i, j, k,x;
    cin >> x;
    ll a=1;
    for(a=1;a*a*a*a*a<=x*x;a++){
        ll b = a*a*a*a*a-x;
        ll ret;
        //cout << a << endl;
        if(b<0)ret=-1,b*=-1;
        else ret=1; 
        for(i=0;i*i*i*i*i<=b;i++){
            if(i*i*i*i*i==b){
                cout << a << " " <<ret*i << endl;
                return 0;
            }
        }
    }
    return 0;
}