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( int argc, char *argv[] ) {
    int n;
    (void)scanf("%d", &n);

    for (long long a=-200; a<200; a++) {
        long double a5 = pow(a,5);
        for (long long b=-200; b<200; b++) {
            long double b5=pow(b,5);
            if (round(a5)-round(b5)==n) {
                printf("%Ld %Ld\n", a, b);
                return 0;
            }
            //printf("%Ld-%Ld=%d\n", a, b, (int)(a5-b5));
        }
    }
}