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>
int main()
{
  long long int X;
  long long int list[1000];
  int i;
  int j;
  long long int temp;
  for(i = 0, j = 0; i < 1000; ++i, ++j){
    list[i] = j * j * j * j * j;
    //printf("%d, ", list[i]);
  }
  scanf("%d", &X);
  for(i = 0; i < 1000; ++i){
    for(j = 0; j < 1000; ++j){
      temp = list[i] - list[j];
      if(temp == X){
        printf("%d %d\n", i, j);
        return 0;
      }
      temp = list[i] + list[j];
      if(temp < 0)
        continue;
      if(temp == X){
        printf("%d %d\n", i, -j);
        return 0;
      }
    }
  }
}