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
flag = false
c = X % 5
i = 1
while i <= X do
    if X % i == 0 && i % 5 == c
        a = 0
        loop do
            break if flag == true
            a5 = a**5
            b5 = (a - i)**5
            if a5 - b5 == X
                puts [a, a - i].join(" ")
                flag = true
            elsif a5 + b5 == X
                puts [a, i - a].join(" ")
                flag = true
            end
            a += 1
            flag = true if a5 + b5 > X && a5 - b5 > X
        end
    end
    i += 1
    break if flag == true
end

if i > X
    i = 1
    while i <= X do
        if X % i == 0 && i % 5 == c
            a = 0
            loop do
                break if flag == true
                a5 = a**5
                b5 = (a - i)**5
                if a5 - b5 == X
                    puts [a, a - i].join(" ")
                    flag = true
                elsif a5 + b5 == X
                    puts [a, i - a].join(" ")
                    flag = true
                end
                a -= 1
                flag = true if a5 + b5 > X && a5 - b5 > X
            end
        end
        flag = false if i == X
        i += 1
    end
end