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)

import kotlin.math.abs
import kotlin.math.pow

fun main(args: Array<String>) {
    val n = 1e6.toInt()
    val x = readLine()!!.toInt()
    for(a in 0..n){
        val bpow5 = (a.toDouble().pow(5.0) - x.toDouble())
        val b = if(bpow5 > 0) bpow5.pow(1.0/5.0)
        else -(-bpow5).pow(1.0/5.0)
        if(abs(b - b.toLong()) < 1e-7){
            println("$a, ${b.toLong()}")
            break
        }
    }
}