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: Runtime Error)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use procontools::prelude::*;

fn main() {
    input! {x:i64,}
    let (mut a, mut b) = (0i64, 0i64);
    while f(a, b) < x {
        b += 1;
    }
    while b > 0 {
        if f(a, b) == x {
            println!("{} {}", a, -b);
            return;
        }
        a += 1;
        if f(a, b) == x {
            println!("{} {}", a, -b);
            return;
        }
        while f(a, b) > x {
            b -= 1;
            if f(a, b) == x {
                println!("{} {}", a, -b);
                return;
            }
        }
    }
    let (mut a, mut b) = (0i64, 0i64);
    while f(a, b) < x {
        b -= 1;
    }
    while b <= 0 {
        if f(a, b) == x {
            println!("{} {}", a, -b);
            return;
        }
        a -= 1;
        if f(a, b) == x {
            println!("{} {}", a, -b);
            return;
        }
        while f(a, b) > x {
            b += 1;
            if f(a, b) == x {
                println!("{} {}", a, -b);
                return;
            }
        }
    }

    unreachable!()
}
fn f(a: i64, b: i64) -> i64 {
    a.pow(5) + b.pow(5)
}
*/

fn main() {
    let exe = "/tmp/bin7E4DDB9D";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";