Problem:
Score : 200 points

Problem Statement

Given are integers a,b,c and d.
If x and y are integers and a \leq x \leq b and c\leq y \leq d hold, what is the maximum possible value of x \times y?

Constraints

-10^9 \leq a \leq b \leq 10^9

-10^9 \leq c \leq d \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a b c d

Output

Print the answer.

Sample Input 1

1 2 1 1

Sample Output 1

2

If x = 1 and y = 1 then x \times y = 1.
If x = 2 and y = 1 then x \times y = 2.
Therefore, the answer is 2.

Sample Input 2

3 5 -4 -2

Sample Output 2

-6

The answer can be negative.

Sample Input 3

-1000000000 0 -1000000000 0

Sample Output 3

1000000000000000000

Solution in Rust (1.42.0) (judge verdict: Accepted)

use proconio::{fastout, input};

#[fastout]
fn main() {
    input! {
        a : i128,
        b: i128,
        c: i128,
        d: i128
    };

    if a >= 0 && c >= 0 {
        let b = b as u128;
        let d = d as u128;

        println!("{}", b * d);
    } else {
        let x1 = a * c;
        let x2 = a * d;
        let x3 = b * c;
        let x4 = b * d;

        let mut result = std::cmp::max(x1, x2);
        result = std::cmp::max(result, x3);
        result = std::cmp::max(result, x4);
        println!("{}", result);
    }
}