A. Rectangle and Squares
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vasya cut out a rectangle of size $$$m \times n$$$ cells from paper. Petya, at each step, cuts out the largest possible square from the rectangle and keeps it. Write a program to determine how many squares will Petya eventually have?

Consider the example. Suppose the initial rectangle has a size of 3 x 5. In the first step, Petya will cut out a 3 x 3 square, leaving a rectangle of 3 x 2. In the second step, Petya will cut out a 2 x 2 square, leaving a rectangle of 1 x 2. In the third step, Petya will cut out a 1 x 1 square, and in the fourth step, he will take the remaining 1 x 1 square. In total, he will have 4 squares.

Input

Two integers $$$m$$$ and $$$n$$$ are given, each on a separate line ($$$1 \le m, n \le 2 \cdot 10^9$$$).

Output

Output a single integer — the number of squares.

Example
Input
3
5
Output
4
Note

Solutions that work correctly for $$$m, n \le 1000$$$ can earn 50 points.