AT_abc460_a.Mod While Positive

You are given positive integers $N$ and $M$.

If the following operation is repeated while the value of $M$ is not $0$, find the number of operations performed.

• Let $x$ be the remainder when $N$ is divided by $M$. Replace the value of $M$ with $x$.

It can be proved that $M$ becomes $0$ after a finite number of operations.

给定正整数 $N$ 和 $M$。

当 $M$ 的值不为 $0$ 时，重复执行以下操作，求总共执行的操作次数：

• 令 $x$ 为 $N$ 除以 $M$ 的余数，将 $M$ 的值替换为 $x$。

可以证明：经过有限次操作后，$M$ 必然变为 $0$。

The input is given from Standard Input in the following format:

$N$ $M$

输入从标准输入中以如下格式给出：

$N$ $M$

Output the answer.

输出答案。

Sample 1 Explanation:
Initially, $N = 8$ and $M = 5$.

The remainder when $8$ is divided by $5$ is $3$, so $M = 3$ after one operation.

The remainder when $8$ is divided by $3$ is $2$, so $M = 2$ after two operations.

The remainder when $8$ is divided by $2$ is $0$, so $M = 0$ after three operations.

Thus, output $3$ as the answer.

Constraints

• $1 \leq N, M \leq 1000$
• All input values are integers.

样例 1 解释：
初始时，$N = 8$，$M = 5$。

$8$ 除以 $5$ 的余数为 $3$，因此经过一次操作后 $M = 3$。

$8$ 除以 $3$ 的余数为 $2$，因此经过两次操作后 $M = 2$。

$8$ 除以 $2$ 的余数为 $0$，因此经过三次操作后 $M = 0$。

因此，输出答案 $3$。

约束条件

• $1 \leq N, M \leq 1000$
• 所有输入值均为整数。