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

x=gets.to_i
array=[0]
1.upto(70) do |i|
  array.push(i**5)
  array.push((-i)**5)
end
array.sort!
a=0
b=0
array.repeated_combination(2) do |an,bn|
  if an-bn==x
    a=an
    b=bn
    break
  elsif bn-an==x
    a=bn
    b=an
    break
  end
end
aindex=array.index(a)-70
bindex=array.index(b)-70
puts [aindex,bindex].join(" ")