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 <math.h>

long factor(long a){
  long tmp1,tmp2;
  tmp1=(a*a)%1000000007;
  tmp2=(tmp1*tmp1)%1000000007;
  return (tmp2*a)%1000000007;
}

int main(){
  long a,b,x;
  long a_tmp,b_tmp;
  
  scanf("%ld",&x);
  
  a=0;
  while(a<1000000000){
    a_tmp=factor(a);
    if(a_tmp-x>0){
      b=pow((double)(a_tmp-x),1.0/5.0);
    } else {
      b=0-pow((double)(x-a_tmp),1.0/5.0);
    }
    b_tmp=factor(b);
    
    if((a_tmp-b_tmp)==x){
      printf("%ld %ld",a,b);
      return 0;
    } else {
      a++;
    }
  }
}