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.to_i
plus = 1
for i in 0..10000000000
 if i**5-x>=0
   a=i**5-x
 else
   a=x - i**5
   plus=0
 end
  c = a**(1/5)
  c1 = c**5
  if c1 == a
    break
  end
end
if plus==0
  c= (-1)*c
end

puts "#{i} #{c}"