Maximizing Trees in a Rectangular Garden

You are given a rectangular garden of dimensions \(W\) (width) and \(H\) (height). The garden is partitioned into square cells of size \(1 \times 1\). You want to plant a tree in each cell so that they do not overlap and each tree is completely inside the garden. Your task is to determine the maximum number of trees that can be planted in the garden.

Note: The answer is simply the product \(W \times H\), representing a grid-like arrangement.

inputFormat

The input consists of a single line containing two space-separated integers \(W\) and \(H\), which represent the width and height of the garden respectively.

outputFormat

Output a single integer which is the maximum number of trees that can be planted in the garden.

10 6

60