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;

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

    let mut a = 0;
    let mut b = 0;
    loop {
        let a5 = a * a * a * a * a;
        if a5 == x {
            b = 0;
            break;
        }
        let mut flag = false;
        if a5 > x {
            while a5 > x + b * b * b * b * b {
                b += 1;
                let b5 = b * b * b * b * b;
                if a5 == x + b5 {
                    flag = true;
                    break;
                }
            }
        } else {
            while a5 < x + b * b * b * b * b {
                b -= 1;
                let b5 = b * b * b * b * b;
                if a5 == x + b5 {
                    flag = true;
                    break;
                }
            }
        }
        if flag {
            break;
        }
        a += 1;
        b = 0;
    }
    println!("{} {}", a, b);
}