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

using namespace std;

int main(){
    int64_t X;
    cin >> X;
    vector<int64_t> temp;

    temp.push_back(0);
    
    int64_t bufA=0,bufB=0;

    for(int i=0;;i++){
        temp.push_back((i+1)*(i+1)*(i+1)*(i+1)*(i+1));
        for(int j =0;j<=i;j++){
            if(temp[i] - temp[j] == X){
                bufA = i;
                bufB = j;
                cout << bufA <<" "<<bufB<<endl;
                return 0;
            }
            else if(temp[i] + temp[j] == X){
                bufA = i;
                bufB = -1 *j;
                cout << bufA <<" "<<bufB<<endl;
                return 0;
            }
        }
    }
}