Given a positive integer n, apply the Collatz conjecture to it: as long as n is not 1, if it is even then divide it by 2 (using // for integer division), if it is odd then multiply it by 3 and add 1. Return the number of divisions you need to apply in this way to reach 1. All examples are guaranteed to reach 1 eventually.