50A-Domino piling

50A-Domino piling

A. Domino pilingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

You are given a rectangular boardM? ×?NSquares. Also you are given an unlimited number of standard domino pieces of 2? ×? 1squares. You are allowed to rotate the pieces. You are asked to place as your 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.

Input

In a single line you are given two integersMAndN-Board sizes in squares (1? ≤?M? ≤?N? ≤? 16 ).

Output

Output one number-the maximal number of dominoes, which can be placed.

Sample test (s) input

2 4

Output

4

Input

3 3

Output

4

import java.util.*;public class Main {    public static void main(String[] args) {                Scanner sc=new Scanner(System.in);        int m=sc.nextInt();        int n=sc.nextInt();        System.out.println(m*n/2);    }}