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: Accepted)

#include<stdio.h>
#include<math.h>
#define pow5(a,b) pow(a,5)-pow(b,5)

int checkNumRange(int upLim){
  int n = 0;
  while(pow5(n,n-1)<=upLim) n++;
  return n;
}

int main() {
  int x,upLim,a,b;
  scanf("%d", &x);
  upLim =checkNumRange(1000000000);
  for(int i = upLim; i > -upLim; i--){
    for(int j = upLim; j > -upLim; j--){
      if(pow5(i,j) == x) { a = i; b = j;}
    }
  }
  printf("%d %d\n",a,b);
}