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)

def abc166_d():
  x = int(input())

  def divisor(n):
    # nの約数列挙、戻り値はsortされていない
    ret = []
    for i in range(1, int(n**0.5)+1):
      if n % i == 0:
        ret.append(i)
        ret.append(n//i)
    return ret

  divs = sorted(divisor(x))
  a = 0
  b = divs[1]
  while True:
    if a**5 - (a-b)**5 == x:
      print(a, b)
      return
    a += 1

abc166_d()