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 <stdlib.h>
int main(){
  long int X,A,B,PB,Psum,Nsum,y,i,j;
  scanf("%ld",&X);
  for(i=1;i<64;i++){
    y=i*i*i*i*i;
    for(j=0;j<i+1;j++){
      PB=j*j*j*j*j;
      Psum=y+PB;
      Nsum=y-PB;
      if(Psum==X){
        A=i;
        B=j*(-1);
        break;
      }
      else if(Nsum==X){
        A=i;
        B=j;
        break;
      }
    }
  }
  printf("%d %d",A,B);
  return 0;
}