Fibonacci recursive algorithm of Number of

def fibo(x, l=[]):
    l.append(x)
    if x== 2:
        l.remove(x)
        return 1,1
    else:
        a, b = fibo(x-1)
        l.remove(x)
        if len(l) == 0:
            return a+b
        return b, a+b