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
loop do
  a5 = a**5
  if a5 < x
    b5 = x - a5
    b = b5 ** (1.0/5)
    bf = b.floor
    bc = b.ceil
    if bf**5 == b5
      puts "#{a} #{-bf}"
      exit
    elsif bc**5 == b5
      puts "#{a} #{-bc}"
      exit
    end
  else
    b5 = a5 - x
    b = b5 ** (1.0/5)
    bf = b.floor
    bc = b.ceil
    if bf**5 == b5
      puts "#{a} #{bf}"
      exit
    elsif bc**5 == b5
      puts "#{a} #{bc}"
      exit
    end
  end
  a += 1
end