#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc126/tasks/abc130_c

def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        tmp = a
        a = b
        b = tmp % b
    return a

w, h, x, y = map(int, input().strip().split())
area = w * h / 2
has_points = 0
if 2 * x == w and 2 * y == h:
    has_points = 1
# if abs(2*x-w) == 0 and h > 1:
#     has_points = 1
# elif abs(2*y-h) == 0 and w > 1:
#     has_points = 1
# elif w >= 3*abs(2*x-w) and h >= 3*abs(2*y-h):
#     has_points = 1
# elif gcd(abs(2*x-w), abs(2*y-h)) > 1:
#     has_points = 1

print(area, has_points) def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        tmp = a
        a = b
        b = tmp % b
    return a gcd if a < b:
        a, b = b, a
     a < b a b a, b = b, a a b b a while b > 0:
        tmp = a
        a = b
        b = tmp % b
     b > 0 b 0 tmp = a tmp a a = b a b b = tmp % b b tmp % b tmp b return a a a a b b w, h, x, y = map(int, input().strip().split()) w map(int, input().strip().split()) map int input().strip().split() ().strip().split ().strip() ().strip () input strip split h x y area = w * h / 2 area w * h / 2 w * h w h 2 has_points = 0 has_points 0 if 2 * x == w and 2 * y == h:
    has_points = 1
# if abs(2*x-w) == 0 and h > 1:
#     has_points = 1
# elif abs(2*y-h) == 0 and w > 1:
#     has_points = 1
# elif w >= 3*abs(2*x-w) and h >= 3*abs(2*y-h):
#     has_points = 1
# elif gcd(abs(2*x-w), abs(2*y-h)) > 1:
#     has_points = 1 2 * x == w and 2 * y == h 2 * x == w 2 * x 2 x w 2 * y == h 2 * y 2 y h has_points = 1 has_points 1 print(area, has_points) print area has_points y = map(int, input().strip().split()) map(int, input().strip().split()) y w, h, x, y = map(int, input().strip().split()) map(int, input().strip().split()) w area = w * h / 2 w * h / 2 area has_points = 1 1 has_points has_points = 0 0 has_points def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        tmp = a
        a = b
        b = tmp % b
    return a def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        tmp = a
        a = b
        b = tmp % b
    return a gcd x, y = map(int, input().strip().split()) map(int, input().strip().split()) x h, x, y = map(int, input().strip().split()) map(int, input().strip().split()) h
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc126/tasks/abc130_c

def gcd(a, b):
    if a < b:
        a, b = b, a
    while b > 0:
        tmp = a
        a = b
        b = tmp % b
    return a

w, h, x, y = map(int, input().strip().split())
area = w * h / 2
has_points = 0
if 2 * x == w and 2 * y == h:
    has_points = 1
# if abs(2*x-w) == 0 and h > 1:
#     has_points = 1
# elif abs(2*y-h) == 0 and w > 1:
#     has_points = 1
# elif w >= 3*abs(2*x-w) and h >= 3*abs(2*y-h):
#     has_points = 1
# elif gcd(abs(2*x-w), abs(2*y-h)) > 1:
#     has_points = 1

print(area, has_points)
