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: i64,
    }

    for c in 1.. {
        if c * c > x {
            break;
        }
        if x % c != 0 {
            continue;
        }
        for &c in &[c, x / c] {
            if c % 5 != x % 5 {
                continue;
            }
            if (x - c.pow(5)) % (5 * c) != 0 {
                continue;
            }
            for b in -1000..=1000 {
                let a = b + c;
                if a.pow(5) - b.pow(5) == x {
                    println!("{} {}", a, b);
                    return;
                }
                let a = b - c;
                if a.pow(5) - b.pow(5) == x {
                    println!("{} {}", a, b);
                    return;
                }
            }
        }
    }
    panic!();
}