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>
#define ll long long
#define rep(i,p) for(ll i=p;i<=63;i++)

int main(){
  int mag=0;
  ll num;
  scanf("%lld",&num);
  rep(X,0){
    rep(Y,X){
      if(Y==0)continue;
      if(num%(X+Y)==0){
        if((X*X*X*X*X)+(Y*Y*Y*Y*Y)==num){
          printf("%lld %lld",X,-Y);
          mag++;
          break;
        };
      }
      else if(Y!=X){
       if(num%(Y-X)==0){
        if((Y*Y*Y*Y*Y)-(X*X*X*X*X)==num){
          printf("%lld %lld",Y,X);
          mag++;
          break;
        };
      };
      };
    };
    if(mag!=0)break;
  };
};