Fibonacci numbers are a classic way to practice loops, recursion, and dynamic programming. The function fib receives n and returns the n-th Fibonacci number: fib(0) is 0, fib(1) is 1, and each next value is the sum of the two previous ones. Be careful with the indexing: the sequence starts from zero.

def fib(n):