output_description: 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}.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      W H x y
attempt: w, h, x, y = map(int, input().split())
  a = w * h
  b = x * h
  c = y * w
  g = 0
  d = (h - y) * w // 2
  e = a - d
  o = b / 2
  p = c / 2
  f = max(min((a - c), c), min(p, a - p))
  i = max(min((a - b), b), min(o, a - o))
  if b == c or d == f or d == e or i == f or i == e:
      g = 1
  if x != w and y != h:
      print(
          "{:.9f}".format(
              max(min(a - max(b, c), max(b, c)), min(a - min(b, c), min(b, c)))
          ),
          g,
      )
  elif x == w or x == 0:
      print("{:.9f}".format(f), g)
  elif y == h or y == 0:
      print("{:.9f}".format(i), g)
  
problem_description: 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.
samples: [{"input": "2 3 1 2", "output": "3.000000 0\n    \n\nThe line x=1 gives the optimal cut, and no other line does.\n\n* * *"}, {"input": "2 2 1 1", "output": "2.000000 1"}]