You are given a rectangular board of *M* × *N* squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:

1. Each domino completely covers two squares.

2. No two dominoes overlap.

3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.

Find the maximum number of dominoes, which can be placed under these restrictions.
In a single line you are given two integers *M* and *N* — board sizes in squares (1 ≤ *M* ≤ *N* ≤ 16).
import math
"""Given MxN board, return the maximum number of dominos(2x1 and can be rotated) that can be fit into the board"""
board_size = input().split(" ")
m = int(board_size[0])
n = int(board_size[1])

board = [[n] for i in range(m)]
dominoes = 0
if m % 2 == 0 and n % 2 == 0:
    # both the width and length of the board are even 4 x 4, all dominoes can be oriented in one direction
    # and then fill the board, max number of dominos will be filled
    dominoes = int((m*n)/2)
elif m % 2 != 0 and n % 2 == 0:
    # odd number of columns and even number of rows
    dominoes = int((m*n)/2)
elif m % 2 == 0 and n % 2 != 0:
    dominoes = (int(m*n)/2)
else:
    # odd number of rows and columns
    dominoes = math.floor((m*n)/2)

print(dominoes)
