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>
#include <string.h>
#include <assert.h>

int main(void) {
  long long int x;
  long long int a,b;
  scanf("%lld", &x);
  //scanf("%d", &b):
  int m;
  int tmp;
  int flag=0;

  for(int i = 0;i<120;i++){
    a = i+2;
    tmp = a;
    a = a*a*a*a*a;
    b = a-x;
    if(b > 0){

      for(int j = 1;j<b/5;j++){
        int c = 0;
        c = b%(j*j*j*j*j);
        if(c == 0){
          m = b;
          flag =1;
          break;
        }
        if(flag == 1){
          break;
        }
      }
    }
    else{
    for(int k = -1;k > -120;k--){
      int d = 0;
      d = b%(k*k*k*k*k);
      if(d == 0){
        m = b/(k*k*k*k*k);
        flag =1;
        break;
      }
      if(flag == 1){
        break;
      }
    }
  }

  }
  printf("%d %d\n",tmp,m);



  return 0;
}