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<stdlib.h>
#include<math.h>
#include<string.h>
#define F(i,a,n) for(int i=a; i<n; i++)
#define INF 100000000000 // long only


int main(){
  long x;
  scanf("%ld",&x);
  int max=2000;
  long a[max],b[max];
  F(i,0,max){
    a[i]=i;
    b[i]=pow(i,5);
  }
  F(i,0,max){
    F(j,0,max){
      if(b[i]-b[j]==x){
        printf("%ld %ld\n",a[i],a[j]);
        return 0;
      }else if(b[i]+b[j]==x){
        printf("%ld %ld\n",a[i],-a[j]);
        return 0;
      }

    }
  }
  return 0;
}