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)

# -*- coding: utf-8 -*-

X = int(input())

i = 0
j = 0


while(1):
    A_5 = pow(i,5) + X
    jud = pow(A_5,0.2)
    if jud.is_integer() == True:
        A = int(jud)
        B = i
        break
    A_5 = pow(j,5) + X
    jud = pow(A_5,0.2)
    if jud.is_integer() == True:
        A = int(jud)
        B = j
        break
    i += 1
    j -= 1


print(A,B)