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: Wrong Answer)

use proconio::{fastout, input};

#[fastout]
fn main() {
  input! {
    X: u64,
  }

  // A^5 - B^5 = X
  // A^5 - X = B^5

  for A5 in (0..=1_000_000_000).map(|n| (n as f64).powi(5) as u64) {
    let B5 = (A5 as f64 - X as f64).abs();
    let B = (B5 as f64).powf(0.2);
    if B.floor() == B.ceil() {
      let mut A = (A5 as f64).powf(0.2);
      if A.powi(5) - B.powi(5) != X as f64 {
        A *= -1.0;
      }
      println!("{} {}", A, B);
      return;
    }
  }
}