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

int main(){
    long i,x,a=1,b=0,abstract=1000000000;
    scanf("%ld",&x);
    while (labs((long)pow(a, 5.0)-x)<abstract) {
        abstract=labs((long)pow(a, 5.0)-x);
        a++;
    }
    while (b==0) {
        for (i=1; i<=abstract; i++) {
            if (abstract==(long)pow(i, 5.0)) b=i;
        }
        a--;
    }
    if ((long)pow(a, 5.0)-x<0) b*=-1;
    printf("%ld %ld",a,b);
    return 0;
}