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: Runtime Error)

import kotlin.system.exitProcess

fun main() {
    val x = readLine()!!.toLong()
    val set = mutableSetOf<String>()

    fun calc(a: Long, b: Long) = a * a * a * a * a - b * b * b * b * b
    fun dfp(a: Long, b: Long) {
        if (a == b) return
        if (x < (a - b)) return

        val key = "$a $b"
        if (set.contains(key)) return
        set.add(key)

        val calc = calc(a, b)
        if (x == calc) {
            println(key)
            exitProcess(0)
        } else if (calc > x) {
            return
        }

        dfp(a + 1, b)
        dfp(a - 1, b)
        dfp(a, b - 1)
        dfp(a, b + 1)
    }

    dfp(1L, 0L)
}