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
a1 = []
a2 = []
up = (x**0.2).to_i
for i in 0..up
  y = (x-(i**5))**0.2
  if y - y.to_i == 0.0
    a1 = [i,y.to_i]
    break
  end
end

if a1 == nil
  for j in 0..10000000
    z = (x+(j**5))**0.2
    if z - z.to_i == 0.0
      a2 = [j,z.to_i]
      break
    end
  end
end

if a1 != []
  puts "#{a1[1]} -#{a1[0]}"
elsif a2 != []
  puts "#{a2[1]} #{a2[0]}"
end