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: Runtime Error)

x = gets.split[0].to_i
# a = gets.split.map(&:to_i)
# i = 1
# ans = 0
# for i in 1..x-1
#     j = i
#     for j in i+1..x
#         if a[i-1] + a[j-1] == j-i
#             ans += 1
#         end
#     end
# end
# print ans
i =1
j = []
for i in 1..63
    j.push(i**5)
end
ary = Array.new().map{Array.new(3,0)}
n = 1
for n in 1..61
    m = n
    for m in n..62
        r = j[n-1]+j[m-1] 
        if r<=1000000000
            ary.push([n,m,r])
        end
        q = j[n-1]-j[m-1]
        if 1 <= q && q <= 1000000000
            aray.push([n,-1*m,q])
        end 
    end
end
ary2 = ary.find { |v| v[2] == x }
print ary2[0]
print ' '
print ary2[1]