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)

def pow5(a)
  a*a*a*a*a
end

x=gets.to_i;
soi=Array.new()
soi.push(1)
i=2
while i*i<=x do
  if x%i==0 then
    soi.push(i)
    soi.push(x/i)
  end
  i+=1
end
soi.push(x)

a=0
b=0

for d in soi do
  a=d
  b=0

  40.times{
    if pow5(a)-pow5(b)==x then
      puts ("#{a} #{b}");
      return
    end
    a+=1
    b+=1
  }

  a=d
  b=0

  40.times{
    if pow5(a)-pow5(b)==x then
      puts ("#{a} #{b}");
      return
    end
    a-=1
    b-=1
  }
end