def fib(i):
    return list(map(lambda x, f=lambda x, f:(f(x-1, f) + f(x-2, f)) if x>1 else 1: f(x,f), range(i)))

n = int(input('Fibonacci Liste bis: '))
if n > 0: print(fib(n))
else: print(n, 'ist zu klein')
fa165666b8c49a47913d6f19573afb52c56c6994
<mask token>

def fib(i):
    return list(map(lambda x, f=lambda x, f: f(x - 1, f) + f(x - 2, f) if x >
        1 else 1: f(x, f), range(i)))


<mask token>

def fib(i):
    return list(map(lambda x, f=lambda x, f: f(x - 1, f) + f(x - 2, f) if x >
        1 else 1: f(x, f), range(i)))


<mask token>
if n > 0:
    print(fib(n))
else:
    print(n, 'ist zu klein')

def fib(i):
    return list(map(lambda x, f=lambda x, f: f(x - 1, f) + f(x - 2, f) if x >
        1 else 1: f(x, f), range(i)))


n = int(input('Fibonacci Liste bis: '))
if n > 0:
    print(fib(n))
else:
    print(n, 'ist zu klein')

def fib(i):
    return list(map(lambda x, f=lambda x, f:(f(x-1, f) + f(x-2, f)) if x>1 else 1: f(x,f), range(i)))

n = int(input('Fibonacci Liste bis: '))
if n > 0: print(fib(n))
else: print(n, 'ist zu klein')