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<stdio.h>
#include<math.h>

int main(void){
    long int X,i;
    scanf("%ld",&X);
    long int A=pow((double)X,0.2);
    //B<0
    for(i=A;i>0;i--){
        long int c=pow(i,5);//A^5
        long int B=pow((X-c),0.2);//(A^5-X)^(1/5)
        if((long int)(pow(i,5)+pow(B,5))==X){
           printf("%ld %ld\n",i,-B);
           return 0;
        }
    }
    //B>0
    i=A+1;
    while(1){    
        long int c=pow(i,5);
        long int B=pow(c-X,0.2);
        if((long int)(pow(i,5)-pow(B,5))==X){
           printf("%ld %ld\n",i,B);
           return 0;
        }
        i++;
    }
    return 0;
}