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>
#define BUFSIZE 1000000000
typedef long long ll;

ll X;
ll rem,rem2;
ll A;
ll B;
ll serch_a(ll A){
  if(X <= (ll)pow(A,5)){
     rem = A;
     return A-1;
   }
  serch_a(A+1);
}
 ll serch_b( ll B){
   if((ll)pow(serch_a(A-1),5) - X == (ll)pow(B,5)){
      rem2 = B;
      return B;
    }
   serch_b(B+1);
 }



int main(void){

 scanf("%d",&X);
serch_a(0);
serch_b(-rem);

printf("%d %d",rem-1,rem2);

}