def fib_recursive(n: int) -> int:
    """ Find the n-th fibonacci number by naive recursion """
    if n == 0:
        return n
    elif n <= 2:
        return 1
    return fib_recursive(n - 1) + fib_recursive(n - 2)