def Fibonacci(n):
    assert n==int(n) and n>=0
    if n==0:
        return [1]
    else:
        F = [1,1]
        for k in range(2,n+1):
            F.append(F[-1]+F[-2])
        return F