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: Wrong Answer)

#include <stdio.h>
#include <math.h>
int main(void){
    int x;
    scanf("%d", &x);

    int n;
    int a;
    for(int i = 0; i < 100; i++){
        n = pow(i, 5);
        if(n == x){
            printf("%d 0", i);
            return 0;
        }else if(x < n){
            a = i - 1;
            n = pow((i - 1), 5);
            break;
        }
    }

    int b;
    b = x - n;
    if(b == 1){
        printf("%d -1", a);
        return 0;
    }

        for(int i = -1; -100 < i; i--){
            int m;
            m = -1 * pow(i, 5);
            if(m == b){
                printf("%d%d", a, i);
                return 0;
            }
        }
}