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: Wrong Answer)

x=int(input())
tmp=0
if x >= 0:
  a=round(pow(x, 0.2))
  while x>a**5:
    if pow(x-a**5, 0.2).is_integer():
      tmp=1
      b=-1*int(pow(x-a**5, 0.2))
      break
    a+=1
  if tmp==0:
    b=int(pow(a**5-x, 0.2))
else:
  b=round(pow(-x, 0.2))
  while -x>b**5:
    if pow(-x-b**5, 0.2).is_integer():
      tmp=1
      a=-1*int(pow(-x-b**5, 0.2))
      break
    b+=1
  if tmp==0:
    a=int(pow(b**5+x, 0.2))
print(a, b)