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::input;
#[allow(unused_imports)]
use proconio::marker::*;

fn main() {
    input!{
        x: i128,
    };

    let mut n: i128 = 0;
    for i in 1..(1000 as i128){
        let tmp = i.pow(5) - (i-1).pow(5);
        // println!("{}", tmp);
        if tmp > 1E9 as i128{
            n = i;
            break;
        }
    }
    // println!("n = {}", n);
    for i in ((-n-1)..n+1).rev(){
        for j in ((-n-1)..n+1).rev(){
            if i.pow(5) - j.pow(5) == x{
                println!("{} {}", i, j );
                return;
            }
        }
    }
}