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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <string>

int X;
long long gozyozu[301];
int a, b;

long long Gozyo (int x) {
  long long tmp = x;
  long long res = x;
  for (int j = 0; j < 4; j++) {
    res *= tmp;
  }
  return res;
}

int main() {
  std::cin >> X;
  for (int i = 0; i < 301; i++) {
    gozyozu[i] = Gozyo(i-150);
  }
  for (int i = -150; i < 151; i++) {
    for (int j = -150; j < 151; j++) {
      if (gozyozu[j+150]-gozyozu[i+150] == X) {
        b = i;
        a = j;
        std::cout << a << " " << b << std::endl;
        return 0;
      }   
    }
  }
  std::cout << a << "not found " << b << std::endl;
}