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: Runtime Error)

X = int(input())
arr= list(range(X))    
print(arr)
count = 0 

for i in range(0, X): 
    for j in range(0,X): 
        if arr[i] + arr[j] == X: 
            if str(arr[i]**0.2).split(".")[1] == "0":
                if str(arr[j]**0.2).split(".")[1] == "0":
                    print(int(arr[i]),int(-arr[j]))