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 Rust (1.42.0) (judge verdict: Accepted)

fn main() {
    let mut line = String::new();
    let _ = std::io::stdin().read_line(&mut line);
    let x = line.trim().parse::<i32>().unwrap();
    'outer: for i in 0.. {
        for a in -i..(i+1) {
            for b in -i..(i+1) {
                if a*a*a*a*a - b*b*b*b*b == x {
                    println!("{} {}", a, b);
                    break 'outer;
                }
            }
        }
    }
}