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 Scala (2.13.1) (judge verdict: Accepted)

import scala.collection.mutable.ArrayBuffer
import scala.io.StdIn

object Main extends App {

  def pow5(x: Long) = x * x * x * x * x
  val x = StdIn.readInt()
  val d = -1000L to 1000L
  val set = d.map(pow5).toSet
  val map = d.map(a => pow5(a) -> a).toMap
  val good = d.filter(a => set.contains(x + pow5(a)))
  println(s"${map(x + pow5(good.head))} ${good.head}")

  def readIntPair: (Int, Int) = {
    val Array(x, y) = StdIn.readLine().split(" ").map(_.toInt)
    (x, y)
  }
}