Read a positive integer n. Repeatedly apply the Collatz rule (if n is even, halve it; if odd, replace it with 3 * n + 1) counting how many steps it takes to reach 1, then print that count.

For input 6 the sequence is 6, 3, 10, 5, 16, 8, 4, 2, 1, which is 8 steps, so the output is:

8