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;

int main(){
    long long a,b,x;

    scanf("%lld",&x);
    for(a=1;;a++){
        bool flag=false;
        long long temp=a*a*a*a*a-x;
        for(b=0;;b++){
            if(b*b*b*b*b==temp){
                printf("%lld %lld",a,b);
                flag=true;
                break;
            }else if(-b*b*b*b*b==temp){
                printf("%lld %lld",a,-b);
                flag=true;
                break;
            }
            if(temp<0&&-b*b*b*b*b<temp){
                break;
            }
            if(temp>0&&b*b*b*b*b>temp){
                break;
            }
        }
        if(flag){
            break;
        }
    }
    return 0;
}