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)

#input
X = int(input())

#output
import math
left = 1
right = 10**2
while left + 1 < right:
    mid = (left + right)//2
    if mid **5  > X:
        right = mid
    else:
        left = mid

A = right
C = A**5 -X

if C >= 0:
    B = pow(C, 1/5)
else:
    B = -pow(-C, 1/5)

left2 = 1
right2 = A
while left2 + 1 < right2:
    mid2 = (left2 + right2)//2
    D = mid2**5 - X
    if D >= 0:
        E = pow(D, 1/5)
    else:
        E = -pow(-D, 1/5)
    if E.is_integer():
        right2 = mid2
    else:
        left2 = mid2
A = left2
C = A**5 - X
if C >= 0:
    B = pow(C, 1/5)
else:
    B = -pow(-C, 1/5) 
print(A, int(B))