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()!!.toInt()
    val a = Math.pow(x.toDouble(), 1/5.toDouble()).toInt()

    println(a)

    var ap = a
    var am = a

    fun calc(A: Int): Boolean {
        val ap5 = Math.pow(A.toDouble(), 5.0).toInt()
        var rp = x - ap5
        val isMinus = (rp < 0)
        if (isMinus) rp = -rp
        var bp5 = Math.pow(rp.toDouble(), 1/5.toDouble()).toInt()

        if (Math.pow(bp5.toDouble(), 5.0).toInt() == rp) {
            if (isMinus) bp5 = -bp5
            println("$A $bp5")
            return true
        }

        return false
    }

    while (true) {
        if (calc(ap)) {
            return
        }
        ap++

        if (calc(am)) {
            return
        }
        am--
    }
}