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 (Clang 10.0.0) (judge verdict: Runtime Error)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
int main(void){
	long long X,A,B,buff;
	int i;
	char str[10000000],buf[10000000];
 
	fgets(str, sizeof(str), stdin);
	X=strtoll(strtok(str ," "),buf,10);

  	if(X!=1){
      A=2;B=0;
      while(1){
          for(B=-X;B<A;B++){
              if( X%(A-B)==0){
                  buff=A*A*A*A + A*A*A*B + A*A*B*B + A*B*B*B + B*B*B*B;
                  if( X%buff==0) break;
              }
          }
          if( X%(A-B)==0){
              buff=A*A*A*A + A*A*A*B + A*A*B*B + A*B*B*B + B*B*B*B;
              if( X%buff==0) break;
          }
          A++;
      }
      	printf("%lld %lld\n",A,B);
    }else{
   		printf("1 0\n");   
    }



	return 0;
}