def fibo(n):
    # Base cases
    if n == 1 or n == 2:
        return 1
    # Recursive case
    else:
        return fibo(n-1) + fibo(n-2)