def fib_recursive(n):
    if n == 0:
        print("count")
        return 0
    elif n == 1:
        print("count")
        return 1
    else:
        print("count")
        return fib_recursive(n-1) + fib_recursive(n-2)
fib_recursive(5)

fib = [0, 1]
for i in range(2, 5):
    print("count2")
    fib.append(fib[i-1] + fib[i-2])
print(fib)
