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

import sys

x = int(input())

a = 0
a_list = []
b = 0
b_list = []
c = 0
c_list = []

while a ** 5 < 10 ** 18:
  a_list.append(a)
  a += 1
  b_list.append(b)
  b -= 1
  c_list.append(c)
  c += 1


for i in a_list:
  for j, k in zip(b_list, c_list):
    if(i ** 5 - j ** 5 == x):
      print(i, j)
      sys.exit()
    elif(i ** 5 - k ** 5 == x):
      print(i, k)
      sys.exit()