Problem:
Score : 300 points

Problem Statement

There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).
You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.

Constraints

1 \leq W,H \leq 10^9

0\leq x\leq W

0\leq y\leq H

All values in input are integers.

Input

Input is given from Standard Input in the following format:

W H x y

Output

Print the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.

The area printed will be judged correct when its absolute or relative error is at most 10^{-9}.

Sample Input 1

2 3 1 2

Sample Output 1

3.000000 0

The line x=1 gives the optimal cut, and no other line does.

Sample Input 2

2 2 1 1

Sample Output 2

2.000000 1

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

main = do
    a:b:c:d:_ <- fmap (fmap read . words) getLine 
    (s, g) <- solve a b c d
    putStr $ show s
    putStr " "
    putStrLn $ show g

solve :: Int -> Int -> Int -> Int -> IO (Float, Int)
solve a b c d = pure (s, g)
    where 
        s = fromIntegral a * fromIntegral b / 2.0
        g = if mod a 2==0 && mod b 2==0 && div a 2 ==c && div b 2 ==d
            then 1
            else 0