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: Time Limit Exceeded)

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
    int i,res1,res2,a,x,b;
    float a1,a2;
    scanf("%d",&x);
    for(i=1;;i++){
        res1 = x+pow(i,5);
        res2 = x+pow(-i,5);
        a1 = pow(res1,0.2);
        a2 = pow(res2,0.2);
        if(a1 == (int)a1){
            a = (int)a1;
            b = i;
            break;
        }
        else if(a2 == (int)a2){
            a = (int)a2;
            b = -i;
            break;
        }
    }
    printf("%d %d",a,b);
    return 0;
}