You are given a square grid consisting of n \times n black and white small squares. This grid can also be represented as a chess board of \frac{n}{k} rows and \frac{n}{k} columns, where each cell consists of k \times k small squares of one color. You need to calculate the number of white squares in this grid.

Example of the board for n = 6 and k = 3. As you can see, there are white squares on it. The lighter color is white and the other is black.
Please note that the cell in the first row and the first column is white.
The first line contains two integers and (1 \leq n, k \leq 100) — the size of a grid and each cell respectively. It is guaranteed that is divisible by .
You have to output a single line containing one integer: the number of white squares on a grid.
Example
Example 1
Example 2
( points): n = 1;
( points): k = 1;
( points): \frac{n}{k} is even;
( points): no additional constraints.