import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

W, H, x, y = rl()

area = H*W*0.5
flag = 0
if x*2 == W and y*2 == H:
	flag = 1
print(area, flag) import sys, math sys math from collections import defaultdict, deque, Counter from bisect import bisect_left, bisect_right from itertools import combinations, permutations, product from heapq import heappush, heappop from functools import lru_cache input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline rs = lambda: input().strip() rs lambda: input().strip() input().strip() ().strip () input strip ri = lambda: int(input()) ri lambda: int(input()) int(input()) int input() input rl = lambda: list(map(int, input().split())) rl lambda: list(map(int, input().split())) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split mod = 1000000007 mod 1000000007 sys.setrecursionlimit(1000000) sys.setrecursionlimit sys setrecursionlimit 1000000 W, H, x, y = rl() W rl() rl H x y area = H*W*0.5 area H*W*0.5 H*W H W 0.5 flag = 0 flag 0 if x*2 == W and y*2 == H:
	flag = 1 x*2 == W and y*2 == H x*2 == W x*2 x 2 W y*2 == H y*2 y 2 H flag = 1 flag 1 print(area, flag) print area flag x, y = rl() rl() x flag = 1 1 flag rs = lambda: input().strip() lambda: input().strip() rs H, x, y = rl() rl() H rl = lambda: list(map(int, input().split())) lambda: list(map(int, input().split())) rl area = H*W*0.5 H*W*0.5 area input = sys.stdin.readline sys.stdin.readline input W, H, x, y = rl() rl() W mod = 1000000007 1000000007 mod flag = 0 0 flag ri = lambda: int(input()) lambda: int(input()) ri y = rl() rl() y
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

W, H, x, y = rl()

area = H*W*0.5
flag = 0
if x*2 == W and y*2 == H:
	flag = 1
print(area, flag)
