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.chomp.to_i

i = 0

arr = []

while 1
  num = i ** 5
  arr << [num, i]
  arr << [-1 * num, -1 * i]
  break if num > 10**9
  i += 1
end


n = arr.size

n.times do |i|
  n.times do |j|
    if arr[i][0] - arr[j][0] == x
      puts "#{arr[i][1]} #{arr[j][1]}"
      exit
    end
  end
end