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)

/* 166b.c */
#include <stdio.h>
#include <math.h>

int main(void){
    int x=0;
    int b=0;
    int a=0;
    int a1=0;
    int b1=0;
    scanf("%d",&x);
    for(int i=0;i<x*x;i++){
        for(int j=0;j<x*x;j++){
            a1=a;
            b1=b;
            for(int k=1;k<5;k++){
                a1=a1*a;
                b1=b1*b;
            }
            if(a1-b1==x){
                printf("%d %d",a,b);
                return 0;
            }else{
                //printf("%d %d\n",a1,b1);
            }
            b--;
        }
        b=0;
        a++;
        b1=0;
        a1=0;
    }
    return 0;
}