def fib_recursive(n):
    """ Fibonacci sequence:
        f_n  = f_(n-1) + f_(n-2); with f_0 = 0, f_1 = 1
        Uses recusive methods to solve
    """
    if n == 0:
        res = 0
    elif n == 1:
        res = 1
    else:
        res = fib_recursive(n - 1) + fib_recursive(n - 2)
    return res