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: Wrong Answer)

use proconio::{input,fastout};
use num::pow::pow;

fn main() {
    input! {
        x: i64,
    }

    for i in 0..=100 {
        let target = pow(i, 5) - x;

        if target == 0 {
            println!("{} 0", x);
            return;
        }

        if target > 0 {
            for j in 1..=100 {
                if target == pow(j, 5) {
                    println!("{} {}", i, j);
                    return;
                }
            }
        } else {
            for j in -100..=-1 {
                if target == pow(j, 5) {
                    println!("{} {}", i, j);
                    return;
                }
            }
        }
    }
}