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)

use proconio::{fastout, input};

fn pow5(a: i128) -> i128 {
    a * a * a * a * a
}

#[fastout]
fn main() {
    input! {
        x: i128,
    }
    for i in 0..1000 {
        let a = pow5(i as i128);
        for j in 0..1000 {
            let b = pow5(j as i128);
            if a - b == x {
                println!("{} {}", i, j);
                return;
            }
            if a + b == x {
                println!("{} {}", i, -(j as i128));
                return;
            }
        }
    }
}