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

if x == 1
  puts '0 -1'
  exit
end

def root(x, n)
  r = 0
  a = 1 << (Math.log(x) / n / Math.log(2))
  while a > 0
    ra = r | a
    d = x - ra ** n
    return ra if d == 0
    r    = ra if d  > 0
    a >>= 1
  end
  return 0
end

puts [root(x - 1, 5), -1].join(' ')