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 JavaScript (Node.js 12.16.1) (judge verdict: Accepted)

"use strict";

const input = require("fs").readFileSync("/dev/stdin", "utf8");
const X = Number(input.trim());

const memo = {};
const pow5 = (n) => {
  if (!memo[n]) {
    memo[n] = Math.pow(n, 5);
  }
  return memo[n];
};

const MAX = 120;
const resultList = [];
for (let a = -MAX; a <= MAX; a++) {
  for (let b = -MAX; b < MAX; b++) {
    if (pow5(a) - pow5(b) === X) {
      resultList.push(a, b);
      break;
    }
  }
  if (resultList.length) {
    break;
  }
}

console.log(resultList.join(" "));