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;

#define all(v) v.begin(), v.end()
typedef long long ll;

int main() {
    ll x; cin >> x;

    for(int i = 0; pow(i, 5) <= pow(10, 9); i++){
        ll w = pow(i, 5);
        for(int j = 0; pow(j, 5) <= pow(10, 9); j++){
            ll t = pow(j, 5);
            if(x == w - t){
                cout << i << " " << j << endl;
                return 0;
            }
            if(x == w + t){
                cout << i << " " << j * -1 << endl;
                return 0;
            }
            if(x == (w * -1) - t){
                cout << i * -1 << " " << j << endl;
                return 0;
            }
            if(x == (w * -1) + t){
                cout << i * -1 << " " << j * -1 << endl;
                return 0;
            }
        }
    }
}