Rectangle Cutting

Given an $a\times b$ rectangle, your task is to cut it into squares. On each move you can select a rectangle and cut it into two rectangles in such a way that all side lengths remain integers. What is the minimum possible number of moves?

Input

Two integers $a$ and $b(1\le a,b\le 500)$.

Output

Print the minimum number of moves.

Examples