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: Accepted)

import sys
X=int(input())
X5=X**0.2
#print('X5=',X5,int(X5))
if X5-int(X5)==0:
    a=int(X5)
    b=0
    print(a,b)
    #print(1)
    sys.exit()
for a in range(1,int(X5)+1):
    for mb in range(a):
        if a**5+mb**5==X:
            print(a,-mb)
            #print(2)
            sys.exit()
for a in range(1,2*int(X5)):
    for b in range(a):
        if a**5-b**5==X:
            print(a,b)
            #print(3)
            sys.exit()
#print(4)