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() {
    proconio::input! {
        x: i32,
    }

    let ub = (2.0 * (x as f64).sqrt().sqrt()) as i32;

    let mut ans = (0, 0);
    for a in -ub..ub {
        let mut b = -ub;
        let mut ok = false;
        while b < ub {
            if a.pow(5) - b.pow(5) == x {
                ok = true;
                break;
            }
            b += 1;
        }
        if ok {
            ans = (a,b);
            break;
        }
    }

    println!("{} {}", ans.0, ans.1);

}