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 PyPy3 (7.3.0) (judge verdict: Accepted)

import sys
readline = sys.stdin.readline

def ff(X):
    res = 1
    if X == 0:
        return 0
    if X <= 0:
        res = -1 
        X = -X
    ok = 10000
    ng = -1
    while abs(ok-ng) > 1:
        med = (ok+ng)//2
        if med**5 >= X:
            ok = med
        else:
            ng = med
    if ok**5 == X:
        return res*ok
    return None
X = int(readline())

for b in range(-1000, 10000):
    a = ff(pow(b, 5) + X)
    if a is not None:
        print(a, b)
        break