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 std::io::*;

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let x: i64 = itr.next().unwrap().parse().unwrap();

    let mut a: Vec<i64> = vec![0; 6666];
    for i in 1..6000 {
        a[i] = (i as i64).pow(5);
    }

    for i in 0..6000 {
        for j in 0..6000 {
            if a[i] + a[j] == x {
                println!("{} -{}", i, j);
                return;
            }
            if a[i] - a[j] == x {
                println!("{} {}", i, j);
                return;
            }
        }
    }
}