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 r_x = String::new();
    std::io::stdin().read_line(&mut r_x).unwrap();
    let x: i64 = r_x.trim().parse().unwrap();

    for a in 0..2048 as i64 {
        for b in 0..2048 as i64 {
            if a.pow(5) - b.pow(5) == x {
                println!("{} {}", a, b);
                std::process::exit(0)
            }
            if a.pow(5) + b.pow(5) == x {
                println!("{} {}", a, -b);
                std::process::exit(0)
            }
        }
    }
}