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 Python (3.8.2) (judge verdict: Wrong Answer)

import math

x = int(input())
template = lambda a, b: "{} {}".format(a, -b) if x >= 0 else "{} {}".format(-a, b)
x = abs(x)
max_a = math.floor(math.pow(x, 1 / 5))
for a in range(max_a + 1):
    for b in range(a + 1):
        if a ** 5 + b ** 5 == x:
            break
print(template(a, b))