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=$stdin.read.chomp.to_i

a = (X.to_f**(1/5.to_f)).round
diff = (a**5) - X
if diff < 0
  b = -1 * ((-1*diff) ** (1/5.to_f)).round
else
  b = (diff ** (1/5.to_f)).round
end

oa = a
f = 1
until a**5 - b**5 == X
  a += f
  diff = X - a**5
  b = if diff < -1
    ((-1*diff) ** (1/5.to_f)).round
  else
    -1 * (diff ** (1/5.to_f)).round
  end
  if oa - a > 100
    a = oa
    f = -1
  end
end

puts "#{a} #{b}"