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

using namespace std;

int main()
{
    #ifdef LOCAL_EXEC
    #else
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #endif // LOCAL_EXEC
    long long int x,i,j,a,b;
    bool y=false;
    long long int A[120];
    for(i=0;i<120;i++){
        A[i]=i;
        for(j=1;j<5;j++){
            A[i]*=i;
        }
    }
    cin>>x;
    for(i=0;i<120;i++){
        for(j=i+1;j<120;j++){
            if(-A[i]-(-A[j])==x){
                a=j;
                b=i;
                y=true;
                break;
            }
            else if(A[i]-(-A[j])==x){
                a=i;
                b=-j;
                y=true;
            }
        }
        if(y==true)
            break;
    }
    cout<<a<<" "<<b;
    return 0;
}