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
options = [0]
1.upto(200) do |i|
  options << i ** 5
end
options.repeated_combination(2) do |combi|
  a, b = combi
  if a + b == x
    a = options.find_index(a)
    b = options.find_index(b)
    b *= -1
    puts "#{a} #{b}"
    exit
  elsif a - b == x
    a = options.find_index(a)
    b = options.find_index(b)
    puts "#{a} #{b}"
    exit
  elsif b - a == x
    a = options.find_index(a)
    b = options.find_index(b)
    a *= -1
    b *= -1
    puts "#{a} #{b}"
    exit
  elsif (b * - 1) - a == x
    a = options.find_index(a)
    b = options.find_index(b)
    a *= -1
    puts "#{a} #{b}"
    exit
  end
end