<gh_stars>1-10
# Time Complexity : O(2 ** n)
def fibo(n):
    if n == 1 or n == 2:
        return 1
    return fibo(n-1) + fibo(n-2)

for i in range(1, 11):
    print(fibo(i))
# Time Complexity : O(2 ** n)
def fibo(n):
    if n == 1 or n == 2:
        return 1
    return fibo(n-1) + fibo(n-2)

for i in range(1, 11):
    print(fibo(i))
# Time Complexity : O(2 ** n)