Minimum Number of 1x2 Tiles

You are given the dimensions of a rectangular floor of size \(M \times N\). Your task is to determine the maximum number of non-overlapping 1 \(\times\) 2 tiles (dominoes) that can be placed on the floor. Each tile covers exactly two cells. This is equivalent to finding \(\lfloor \frac{M \times N}{2} \rfloor\), the floor division of \(M \times N\) by 2.

Example: For a floor of dimensions 5 \(\times\) 3, the answer is 7 because \(5 \times 3 = 15\) and \(\lfloor 15/2 \rfloor = 7\).

inputFormat

The input consists of two space-separated integers \(M\) and \(N\) that represent the dimensions of the floor.

Constraints may be assumed as \(1 \le M, N \le 1000\) for practical purposes.

outputFormat

Output a single integer: the maximum number of 1x2 tiles (dominoes) that can be placed on the \(M \times N\) floor, computed as \(\lfloor \frac{M \times N}{2} \rfloor\).

5 3

7