def fbnq(n):

     if n == 0 or n == 1:

         return 1

     else:

         return fbnq(n-1)+fbnq(n-2)

 print(fbnq(15))

987

def j(n):

    if n == 1:

        return n

    else:

        return n*j(n-1)

print(j(4))

24