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: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<stdbool.h>
#include<math.h>
#include<limits.h>
#define MAX 1000000000
typedef long long ll;
ll ans[400]={0};
ll cal5(ll a){
    if(ans[a+200]==0) return ans[a+200] = a*a*a*a*a;
    else return ans[a+200];
}

int main(){
    ll X;
    scanf("%lld",&X);
    for(ll i=0;cal5(i)<=MAX;i++){
        for(ll j=0;cal5(i)-cal5(j)<=MAX;j++){
            if(cal5(i)-cal5(j)==X){
                printf("%lld %lld",i,j);
                return 0;
            }
        }
    }
    for(ll i=0;cal5(i)<=MAX;i++){
        for(ll j=0;cal5(i)-cal5(j)<=MAX;j--){
            if(cal5(i)-cal5(j)==X){
                printf("%lld %lld",i,j);
                return 0;
            }
        }
    }


}