# Fibonacci rekurzivno
def fib1(n):
    if n == 0 or n == 1: return n
    else: return fib1(n-1) + fib1(n-2)

# Telo fibonaccija (razpremo rekurzijo)
def phi(g, n):
    if n == 0 or n == 1: return n
    else: return g(n-1) + g(n-2)

# Fibonacci
def fib2(n): return phi(fib2, n)

for i in range(10): print (fib2(i))