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 (Clang 10.0.0) (judge verdict: Accepted)

#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
  int i, j, k;
  long X;
  long A, B;
  long a, b;
  long ans = 0;
  scanf("%ld", &X);
  for (j = 0; j < 1000; j++) {
    A = j * j * j * j * j;
    for (i = 0; i < 1000; i++) {
      B = i * i * i * i * i;
      if ((A - B) == X) {
        printf("%d %d", j ,i);
        return 0;
      }
      B *= (-1);
      if ((A - B) == X) {
        printf("%d %d", j, i * (-1));
        return 0;
      }
    }
    A *= (-1);
    for (i = 0; i < 1000; i++) {
      B = i * i * i * i * i;
      if ((A - B) == X) {
        printf("%d %d", j*(-1), i);
        return 0;
      }
      B *= (-1);
      if ((A - B) == X) {
        printf("%d %d", j*(-1), i * (-1));
        return 0;
      }
    }
  }
  return 0;
}