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)

//#![warn(unused_imports)]
use proconio::input;
// use proconio::marker::Usize1;
use std::collections::HashMap;

fn main() {
  input! {
    X: i64,
  }
  
  let mut map: HashMap<i64, i64> = HashMap::new();
  
  for a in -200i64..200i64 {
    let val = a.pow(5);
    map.insert(val, a);
  }
    
  for a in -200i64..200i64 {
    let val = a.pow(5);
    let diff = X - val;
    if let Some(b) = map.get(&diff) {
      println!("{} {}", a, -1 * b);
      return
    }  
  }
}