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 ans = solve(input());
    println!("{} {}", ans.0, ans.1);
}

fn input() -> i64 {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.pop();
    let x: i64 = buf.parse().unwrap();
    x
}

fn solve(x: i64) -> (i64, i64) {
    for a in -118..120 {
        for b in -119..119 {
            if (a as i64).pow(5) - (b as i64).pow(5) == x {
                return (a, b);
            }
        }
    }
    (-1, -1)
}