import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
# import math
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# sys.setrecursionlimit(int(pow(10, 2)))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)


    


W,H,x,y=l()

if(x==W/2 and y==H/2):
    print(W*H/2,1)
else:
    print(W*H/2,0)
 import sys sys from functools import lru_cache, cmp_to_key from heapq import merge, heapify, heappop, heappush from math import * from collections import defaultdict as dd, deque, Counter as C from itertools import combinations as comb, permutations as perm from bisect import bisect_left as bl, bisect_right as br, bisect from time import perf_counter from fractions import Fraction mod = int(pow(10, 9) + 7) mod int(pow(10, 9) + 7) int pow(10, 9) + 7 pow(10, 9) pow 10 9 7 mod2 = 998244353 mod2 998244353 def data(): return sys.stdin.readline().strip() data def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end) out end="\n" end "\n" *var def l(): return list(sp()) l def sl(): return list(ssp()) sl def sp(): return map(int, data().split()) sp def ssp(): return map(str, data().split()) ssp val for i in range(n) for i in range(n) i range(n) range n for i in range(n) val def l1d(n, val=0): return [val for i in range(n)] l1d n n val=0 val 0 l1d(n, val) for j in range(m) for j in range(m) j range(m) range m for j in range(m) l1d(n, val) l1d n val def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)


     l2d n n m m val=0 val 0 W,H,x,y=l() W l() l H x y if(x==W/2 and y==H/2):
    print(W*H/2,1)
else:
    print(W*H/2,0) x==W/2 and y==H/2 x==W/2 x W/2 W 2 y==H/2 y H/2 H 2 print(W*H/2,1) print W*H/2 W*H W H 2 1 print(W*H/2,0) print W*H/2 W*H W H 2 0 y=l() l() y def l(): return list(sp()) def l(): return list(sp()) l def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)


     def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)


     l2d W,H,x,y=l() l() W x,y=l() l() x def ssp(): return map(str, data().split()) def ssp(): return map(str, data().split()) ssp H,x,y=l() l() H def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end) def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end) out def sp(): return map(int, data().split()) def sp(): return map(int, data().split()) sp mod = int(pow(10, 9) + 7) int(pow(10, 9) + 7) mod def sl(): return list(ssp()) def sl(): return list(ssp()) sl def data(): return sys.stdin.readline().strip() def data(): return sys.stdin.readline().strip() data def l1d(n, val=0): return [val for i in range(n)] def l1d(n, val=0): return [val for i in range(n)] l1d mod2 = 998244353 998244353 mod2
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
# import math
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# sys.setrecursionlimit(int(pow(10, 2)))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]





# @lru_cache(None)


    


W,H,x,y=l()

if(x==W/2 and y==H/2):
    print(W*H/2,1)
else:
    print(W*H/2,0)

