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 n = readLine()!!.toLong()
    var list = mutableListOf<Long>()
    for (i in 0 until 100){
        list.add((i.toLong() * i * i * i * i))
    }
    var lefta = 0
    var righta = 0
    list.forEach {left:Long ->
        list.forEach {right:Long ->
            if (left - right == n) {
                lefta = list.indexOf(left)
                righta = list.indexOf(right)
            }
            else if (left + right == n) {
                lefta = list.indexOf(left)
                righta = list.indexOf(right) * -1
            }
        }
    }
    println("$lefta $righta" )
}