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: i64,
    }
    for a in 0..1000 {
        let d=a*a*a*a*a-x;
        let mut l=0;
        let mut r=1000;
        while l<r {
            let m=(l+r)/2;
            let v=m*m*m*m*m;
            if d.abs()<v {
                r=m;
            }
            else if d.abs()>v {
                l=m+1;
            }
            else {
                println!("{} {}",a,if d<0 {-m} else {m});
                return;
            }
        }
    }
    println!("0 0");
}