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: Accepted)

X = gets.to_i

a = 0
b = 0
loop do
  a5 = a ** 5
  b5 = a5 - X
  break if b5 == 0

  flg = false
  if b5 > 0
    b = 1
    while b ** 5 <= b5
      if b ** 5 == b5
        flg = true
        break
      end

      b += 1
    end
  else
    b = -1
    while b ** 5 >= b5
      if b ** 5 == b5
        flg = true
        break
      end

      b -= 1
    end
  end

  break if flg

  a += 1
end

puts "#{a} #{b.to_i}"