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

    let mut a: i128 = 1;
    let mut b: i128 = 0;

    loop {
        if a.pow(5) < x {
            a += 1;
        } else {
            break;
        }
    }

    loop {
        if (a - b.pow(5)) > x {
            b += 1;
        } else {
            break;
        }
    }

    if check(a, b, x) {
        println!("{} {}", a, b);
        return;
    }

    let mut w = 1;

    loop {
        for w1 in 0..(w + 1) {
            for w2 in 0..(w + 1) {
                if check(a + w1, b + w2, x) {
                    println!("{} {}", a + w1, b + w2);
                    return;
                }

                if check(a + w1, b - w2, x) {
                    println!("{} {}", a + w1, b - w2);
                    return;
                }

                if check(a - w1, b - w2, x) {
                    println!("{} {}", a - w1, b - w2);
                    return;
                }
            }
        }

        w += 1;
    }
}

fn check(a: i128, b: i128, x: i128) -> bool {
    if (a.pow(5) - b.pow(5)) == x {
        return true;
    } else {
        return false;
    }
}