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

x = int(input())
res1 = 0
res2 = 0
res = 0
i = 1 
j = 0
jmem = 1000
trouve = 0
while i < x:
    j = 0
    jmem = 1000
    while j < x:
        res1 = i**5
        res2 = j**5
        res = res1 - res2
        if res == x:
            trouve = 1
            break
        if j > 0:
            if res < x:
                jmem = j
                j += 1
            elif res > x:
                jmem = j
                j -= 1
        elif j <= 0:
            if res > x:
                if j+1 == jmem:
                    break
                jmem = j
                j += 1
            elif res < x:
                if j-1 == jmem:
                    break
                jmem = j
                j -= 1
        #print(i,j)
        
    if trouve: 
        break
    else:
        i += 1

print(i, j)