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: Wrong Answer)

x=gets.to_i

(-1000000..1000000).each do |a|
    #p a**5
    b=(a**5-x)**0.2
    #p b
    if !b.is_a?(Complex)
        if b==b.ceil
            puts "#{a} #{b.abs.to_i}"
            break
        end
    end

    if b.abs == b.abs.ceil
        bb = b.abs.ceil
        if a**5-b**5==x
            puts "#{a} #{-b.abs.to_i}"
            break
        end
    end
end