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 = list(map(int, input().split()))
  judge = 0
  # 綺麗に二等分するのが面積は最善である。
  area = float(W * H / 2)
  # (x,y)を通るときもう一点は自動的に(y,x)になる。だがx == yの時は別に考える。
  """
  ・図形を二等分する直線が二つ以上ある
  ・その二つの直線の中点が重なりそれが点(x,y)となる
  この二つの条件を満たせば複数の分割法があると言える。
  これを考えるとW,Hが偶数値で、x,yはそれぞれx = W/2, y = H/2でなくてはならない
  """
  if W % 2 == 0 and H % 2 == 0:
      if x == int(W / 2) and y == int(H / 2):
          judge += 1
  # 結果
  print(area, judge)
  
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"}]