Problem9319--ABC297 —— D - Count Subtractions

9319: ABC297 —— D - Count Subtractions

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

You are given positive integers $A$ and $B$.

You will repeat the following operation until $A=B$:

-   compare $A$ and $B$ to perform one of the following two:
    -   if $A > B$, replace $A$ with $A-B$;
    -   if $A < B$, replace $B$ with $B-A$.

How many times will you repeat it until $A=B$? It is guaranteed that a finite repetition makes $A=B$.

Input

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

```
$A$ $B$
```

Output

Print the answer.

Constraints

$1 \le A,B \le 10^{18}$
All values in the input are integers.

Sample 1 Input

3 8

Sample 1 Output

4
Initially, A=3 and B=8. You repeat the operation as follows:
  • A<B, so replace B with B−A=5, making A=3 and B=5.
  • A<B, so replace B with B−A=2, making A=3 and B=2.
  • A>B, so replace A with A−B=1, making A=1 and B=2.
  • A<B, so replace B with B−A=1, making A=1 and B=1.
Thus, you repeat it four times.

Sample 2 Input

1234567890 1234567890

Sample 2 Output

0

Sample 3 Input

1597 987

Sample 3 Output

15

Source/Category