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 Ruby (2.7.1) (judge verdict: Time Limit Exceeded)

X = gets.chomp.to_i               # 単一整数
X.freeze

a = 0
b = 0

for num1 in 0..X do
  for num2 in -num1..num1 do
    if num1 ** 5 - num2 ** 5 == X then
      a = num1
      b = num2
      break
    end
  end
end
puts a.to_s + " " + b.to_s