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

def pow5(n)
	m = n*n
	return m*m*n
end

def ele(x, n)
	n += 1
	while true
		if x%n==0 then return n end
		n += 1
	end
end

def search(e,x)
	a1 = 0
	a2 = 0
	while true
		x1 = pow5(a1) - pow5(a1-e)
		x2 = pow5(a2) - pow5(a2-e)
		if x1>x && x2>x then return -1 end
		if x1 == x then
			return a1
		end
		if x2 == x then
			return a2
		end
		a1 += 1
		a2 -= 1
	end
end

if x==1 then
	print(0)
	print(" ")
	print(-1)
else
	a = -1
	e = 1
	while a!=-1
		e = ele(x,e)
		a = search(e,x)
	end
	print(a)
	print(" ")
	print(a-e)
end