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 Kotlin (1.3.71) (judge verdict: Accepted)

import java.util.Scanner
import kotlin.math.*

fun main() {
	val scn = Scanner(System.`in`)
	val x = scn.nextDouble()
	var a = 0L
	while(true){
		val a5 = Math.pow(a.toDouble(), 5.0)
		if (a5==x){
			println("$a 0")
			return
		}else {
			var b = Math.pow(a5-x, 0.2)
			if (b.isNaN()) b = -Math.pow(x-a5, 0.2)
			if (a5 - Math.pow(floor(b), 5.0)==x){
				println("$a ${floor(b).toLong()}")
				return
			}else if (a5 - Math.pow(ceil(b), 5.0)==x){
				println("$a ${ceil(b).toLong()}")
				return
			}
		}
		a++
	}
}