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)

def main():
    x = int(input())
    c = x%5
    while x%c!=0:
        c+=5
    ans = (x-c**5)/c/5
    def f(x):
        return c**3*x + 2*c**2*x**2+2*c*x**3+x**4-ans
    if f(0)>0:
        b=-1
        while f(b)!=0:
            b-=1
    elif f(0)==0:
        b = 0
    else:
        b=1
        while f(b)!=0:
            b+=1
    print(int(b+c),int(b))


if __name__ == "__main__":
    main()