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 PyPy3 (7.3.0) (judge verdict: Wrong Answer)

import math
x=int(input())
for i in range(1,int(math.sqrt(x)+1)):
    if x % i==0:
        t=i
        w=x//i
        a=1
        while a<=t:
            b=t-a
            if a**5-b**5==x:
                print(a,b)
                exit()
            b=a-t
            if a**5-b**5==x:
                print(a,b)
                exit()
            a+=1