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)

import java.io.PrintWriter

fun main() {
    val pw = PrintWriter(System.out)

    val x = readInputLine().toLong()

    fun pow5(x: Long): Long = x * x * x * x * x

    for (a in LongRange(-1000L, 1000)) {
        val a5 = pow5(a)
        if (a5 >= x) {
            for (b in LongRange(0L, 1000L)) {
                val b5 = pow5(b)
                if (a5 - b5 == x) {
                    pw.println("$a $b")
                    pw.flush()
                    return
                }
                if (a5 - b5 < x) {
                    break
                }
            }
        } else {
            for (b in LongRange(-1000L, 0L).reversed()) {
                val b5 = pow5(b)
                if (a5 - b5 == x) {
                    pw.println("$a $b")
                    pw.flush()
                    return
                }
                if (a5 - b5 > x) {
                    break
                }
            }
        }
    }

    /*
    pw.println(ans)

    pw.flush()
     */
}

fun readInputLine(): String {
    return readLine()!!
}