Collatz conjecture - OnBrowser Judge example (Ruby)

Problem Statement

There is an unsolved mathematical problem called the "Collatz conjecture." For any natural number, if you repeat the "operation" of "If it is odd, multiply by \(3\) and add \(1\). If it is even, divide it by \(2\)." The expectation is that if you repeat this "operation" over and over again, you will always end up with \(1\) at some point.

Given a natural number \(n\), find the number of "operations" required for it to become \(1\).

Constraints

• \(1 ≤ n ≤ 10000\)
• \(n\) is integer.

Input

Output

Output the minimum number of "operations" required for \(n\) to become \(1\), as an integer.

Sample Input 1

5

Sample Output 1

5

\(5 → 16 → 8 → 4 → 2 → 1\) and so on for \(5\) 'operations' to \(1\).

Sample Input 2

7

Sample Output 2

16

Sample Input 3

1

Sample Output 3

0

If it is \(1\) from the beginning, no "operation" is needed, which means that the "operation" is \(0\) times.

27

111

55

112

automatically copy the program at run time

Results: