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 Ruby (2.7.1) (judge verdict: Accepted)

X = gets.to_i
sq = []
prev = 0
0.upto(100000) do |i|
  d = i*i*i*i*i
  sq << d
  break if d - prev > 1000000000
  prev = d
end

sq2 = sq.dup
sq.each do |a|
    sq2.shift
    sq2.each do |b|
        if a - b == X
            puts "#{sq.index(a)} #{sq.index(b)}"
            exit
        elsif (-a) - b == X
            puts "-#{sq.index(a)} #{sq.index(b)}"
            exit
        elsif a + b == X
            puts "#{sq.index(a)} -#{sq.index(b)}"
            exit
        elsif (-a) + b == X
            puts "-#{sq.index(a)} -#{sq.index(b)}"
            exit
        end
    end
end