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: Time Limit Exceeded)

use proconio::input;

fn main() {
    input! {
        n: i64
    }

    let max = {
        let mut max:i64 = 1;
        let mut k = 1;
        while k < n {
            k = (max+1).pow(5) - max.pow(5);
            max += 1;
        }
        max
    };
    
    let mut a: i64 = 0;
    let mut b: i64 = 0;
    let mut flag = false;
    for i in (1..=n).filter(|i| n % i == 0) {
        for j in 0..=max {
            if n == j.pow(5) - (j-i).pow(5) {
                a = j as i64;
                b = (j-i) as i64;
                flag = true;
                break;
            }
        if flag {
            break;
        }
        }
    }

    println!("{} {}",a,b)
}