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 java.util.*

fun floorRoot5(n: Int): Int {
    if (n == 0 || n == 1) return n
    var res = 0
    while (res * res * res * res * res <= n) res++
    return res - 1
}

fun main(args: Array<String>) {
    val scan = Scanner(System.`in`)
    var kotlin=scan.nextLine().toInt()
    var n = floorRoot5(kotlin)+1
    var ans = false
    var a= 0
    var b = 0
    var i =n
    while(i>0)
    {
        if((Math.pow(n.toDouble(),5.toDouble()))-(Math.pow(i.toDouble(),5.toDouble()))==kotlin.toDouble())
        {
            ans=true
            a=n
            b=i
            break
        }
        i--
    }
        i=-(n-1)
        while(i<=0)
        {
            if((Math.pow((n-1).toDouble(),5.toDouble()))-(Math.pow(i.toDouble(),5.toDouble()))==kotlin.toDouble())
            {
                ans=true
                a=n-1
                b=i
                break
            }
            i++
        }
    println("$a $b")
}