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

#!/usr/bin/env python3
import sys

X = int(input())

for i in range(-10,X+1):
    if i == 0:
        continue
    tmp = X / i
    if tmp.is_integer():
        # for j in range(-i,int(tmp)):
        p = []
        if int(tmp) < i:
            p.append(int(tmp))
            p.append(i)
        else:
            p.append(i)
            p.append(int(tmp))

        for k in p:
            for j in range(-i,k):
                a = j
                b = i - a
                # print("tmp = {}".format(tmp))
                # print("a = {}".format(a))
                # print("b = {}".format(b))
                if a**5 - b**5 == X:
                    print("{} {}".format(a,b))
                    sys.exit()
                if b**5 - a**5 == X:
                    print("{} {}".format(b,a))
                    sys.exit()