#Using Recursion
def fib(n, lst = [0]):
"""Returns a list for n fib numbers | Time Complexity O(n)"""
l = []
if n == 1:
lst.append(1)
if n > 1:
l = fib(n-1, lst)
lst.append(l[-1]+l[-2])
return lst
#list of fibonacci numbers
lst = fib(int(input("val: ")))
print(lst)