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: Time Limit Exceeded)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

typedef long long ll;

int main(){
  long long x;
  int t;
  long long a,b;

  scanf("%lld", &x);

  t = 2;
  while(t*t <= x){
    if(x % t == 0) {
      break;
      x = x/t;
    }

    else t++;
  }

  if(x == 1) t = 1;

  a = 0;
  while(1){
    b = a - t;

    if((a*a*a*a + a*a*a*b + a*a*b*b + a*b*b*b + b*b*b*b) == x){
      printf("%lld %lld\n", a, b);
      break;
    }

    a++;
  }

  return 0;
}