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

'use strict';

const inputs = require('fs').readFileSync('/dev/stdin', 'utf8').split('\n');
const input = parseInt(inputs[0], 10);

let A = 0;
let B = 0;
for (;;) {
  ++A;
  --B;

  if (calc(A, B) === input) {
    console.log(A, B);
    return;
  }

  if (calc(A, B) >= input) {
    break;
  }
}

for (;;) {
  if (calc(A - 1, B) === input) {
    console.log(A - 1, B);
    return;
  }

  if (calc(A, B + 1) === input) {
    console.log(A, B + 1);
    return;
  }

  --A;
  ++B;

  if (calc(A, B) === input) {
    console.log(A, B);
    return;
  }
}

function calc(value1, value2) {
  return value1 ** 5 - value2 ** 5;
}