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>

long int FF(long int X){
  int i;
  long int ans = 1;
  for(i=0;i<5;i++){
    ans*=X;
  }
  return ans;
}

int main(){
  long int X;
  long int A = 0,B = 0;
  long int tmp=0;
  long int i,j;
  
  scanf("%ld",&X);
  
  for(i=0;i<100;i++){
      //    printf("%ld \n",FF(i));
    for(j=0;j<100;j++){
      if(FF(i)-FF(j) == X) {
        tmp = 1;
        break;
      }else if(FF(i) + FF(j) == X){
        tmp = 2;
        break;
      }
    }
    if(tmp != 0){
      if(tmp == 1){
        break;
      }else{
        j = j *(-1);
        break;
      }
    }
  }
  
  printf("%ld %ld\n",i,j);
  
  return 0;
}