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 <stdio.h>
#include <vector> 
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <cmath>
using namespace std;

int main(){
    signed long X;
    cin>>X;
    signed long A,B;
    vector<signed long> ALL;
    for(int i=0;i<10;i++){
        long tmp=pow(i,5);
        ALL.push_back(tmp);
        cout<<tmp<<endl;
    }
    bool ok=false;
    for(int i=-9;i<10;i++){
        signed long tmp;
        if(i<0){
            tmp=X-ALL[abs(i)];
        }else{
            tmp=X+ALL[i];

        }
        if(tmp<0){
            for(int j=0;j<ALL.size();j++){
            if(ALL[j]==abs(tmp)){
                A=-j;
                B=i;
                ok=true;
                break;
            }
        }
        }else{
            for(int j=0;j<ALL.size();j++){
                if(ALL[j]==tmp){
                    A=j;
                    B=i;
                    ok=true;
                    break;
                }
            }
        }

        if(ok)break;
    }
    cout<<A<<" "<<B;





}