The Collatz conjecture works like a number game where you keep applying one of two rules. The function steps receives a positive integer number and counts how many steps it takes to reach 1. If the number is even, divide it by 2; if it is odd, multiply it by 3 and add 1.

def steps(number: int) -> int: