斐波那契数列递归法实现

#斐波那契额数列
def f(s):
    if s in [1,2]:
        return 1
    else:
        return f(s-1)+f(s-2)