Murzik has made one of the flower beds in the shape of a chessboard with dimensions m \times n, where some flowers grow in each cell. Sometimes he takes Anfisa for a walk on this flower bed (yes, don't be surprised, they are indeed friends). Anfisa always starts from the top left corner and moves to the bottom right corner of the flower bed, collecting flowers in such a way that she takes a new route each time, and Murzik gives her a piece of cheese at the exit.
Calculate the maximum number of pieces of cheese Anfisa will receive if she always tries to collect as many flowers as possible. During each of her moves, Anfisa must collect at least one flower.
The first line contains one integer (1 \leq n \leq 1\,000).
The second line contains one integer (1 \leq m \leq 1\,000).
Output one integer — the answer to the problem.
Example 1