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 <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll X; cin >> X;
  for (ll i = 0; i < 10000; i++) {
    double B5;
    ll B, A;

    A = i;
    B5 = pow(A, 5) - X;
    B = pow(abs(B5), 1.0 / 5.0);
    if (B5 < 0) B = -B;
    if (abs(pow(A, 5) - pow(B, 5) - X) < 1) {
      cout << A << ' ' << B;
      break;
    }

    A = -i;
    B5 = pow(A, 5) - X;
    B = pow(abs(B5), 1.0 / 5.0);
    if (B5 < 0) B = -B;
    if (abs(pow(A, 5) - pow(B, 5) - X) < 1) {
      cout << A << ' ' << B;
      break;
    }
  }
 return 0;
}