task102.py

def step(mins, n):
    if n == 1:
        return 0
    if (mins[n] != -1):
        return mins[n]

    result = 1 + step(mins, n-1)
    if (n % 2 == 0):
        result = min(result, 1 + step(mins, n // 2))  
    if (n % 3 == 0):
        result = min(result, 1 + step(mins, n // 3))

    mins[n] = result
    return result

def solve (n):
    mins = [-1] * (n+1)
    
    return step(mins, n)