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 Julia (1.4.0) (judge verdict: Accepted)

const teststr = 
"""
33
"""

function lines()
  Channel{String}(32) do ch
	ll = readlines()
    lines = isempty(ll) ? split(teststr, "\n") : ll
    for s in lines
      put!(ch, s)
    end
  end
end

function main()
  ch = lines()
  X = parse(Int, take!(ch))
  maxA = 10^10
  for A in (x for absx in 0:maxA for x in (absx, -absx))
    B5 = A^5 - X
    Bf = Float64(abs(B5))^(1.0/5)
    B5 < 0 && (Bf = -Bf)
    B = round(Int, Bf)
    if A^5 - B^5 == X
      println("$A $B")
      exit(0)
    end
  end
end

main()