# fibonacci.py
# Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
# Compute Fibonocci sequence recursively

# Compute and return the nth Fibonacci number
def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        f = fibonacci(n-1) + fibonacci(n-2)
        return f

f = fibonacci(12)
print(f)