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: Wrong Answer)

fun main(args: Array<String>) {
    val x = readLine()!!.toDouble()
    val nearest = x.pow(0.2)
    var i = 0
    while (true) {
        val bigger = ceil(nearest + i).pow(5)
        val diff1 = ceil((bigger - x).pow(0.2))
        if (diff1 - diff1.toInt() == 0.0) {
            println("${bigger.toInt()} ${diff1.toInt()}")
            return
        }

        val smaller = floor(nearest - i).pow(5)
        val diff2 = ceil((x - smaller).pow(0.2))
        if (diff2 - diff2.toInt() == 0.0) {
            println("${smaller.toInt()} ${-diff2.toInt()}")
            return
        }

        i++
    }
}

fun Double.pow(x: Double) = Math.pow(this, x)
fun Double.pow(x: Int) = Math.pow(this, x.toDouble())
fun ceil(x: Double) = Math.ceil(x)
fun floor(x: Double) = Math.floor(x)