CF837E.Vasya's Function

Vasya is studying number theory. He has denoted a function f(a, b) such that:

• f(a, 0) = 0;
• f(a, b) = 1 + f(a, b - gcd(a, b)), where gcd(a, b) is the greatest common divisor of a and b.

Vasya has two numbers x and y, and he wants to calculate f(x, y). He tried to do it by himself, but found out that calculating this function the way he wants to do that might take very long time. So he decided to ask you to implement a program that will calculate this function swiftly.

瓦西娅正在学习数论。他定义了一个函数 $f(a, b)$，满足：

• $f(a, 0) = 0$；
• $f(a, b) = 1 + f(a, b - \gcd(a, b))$，其中 $\gcd(a, b)$ 表示 $a$ 与 $b$ 的最大公约数。

瓦西娅有两个数 $x$ 和 $y$，他希望计算 $f(x, y)$。他尝试自己手动计算，却发现按此方式直接计算可能需要非常长的时间。因此，他决定请你编写一个程序来快速计算该函数。

The first line contains two integer numbers x and y (1 ≤ x, y ≤ 1012).

第一行包含两个整数 $x$ 和 $y$（$1 \leq x, y \leq 10^{12}$）。

Print f(x, y).

输出 $f(x, y)$。