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.to_i

m = 1
while x > 5 * m ** 4 + 10 * m ** 3 + 10 * m ** 2 + 5 * m + 1
    m += 1
end
m += 1

nums = (0..m).map{|it| it ** 5}
(0..m).to_a.combination(2).each{|a, b|
    if x == nums[a] + nums[b]
        puts [a, -b].join(' ')
        break
    elsif  x == nums[b] - nums[a]
        puts [b, a].join(' ')
        breakruby 
    end
}