def fib_recursive_mathy_cached(n):
    """Same function as "fib_recursive_mathy", but this is cached using a generic memoizer as decorator.
    
    The decorator is implemented in "./util/cache.py".
    """
    if n < 2:
        return n

    return fib_recursive_mathy_cached(n - 1) + fib_recursive_mathy_cached(n - 2)