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)

fun main() = abc166d()

@OptIn(ExperimentalStdlibApi::class)
fun abc166d() {
    val x = readLine()!!.toLong()

    val set = mutableSetOf<Long>()

    for (i in -500L..500L) {
        set.add(pow(i, 5))
    }

    val list = set.sorted().toLongArray()

    for (left in list.indices) {
        for (right in list.indices) {
            if (list[left] - list[right] == x) return println("${left - 500} ${right - 500}")
        }
    }

    error("nande?")
}

private fun pow(n: Long, p: Long): Long = (1L..p).fold(1L) { acc, i -> acc * n }