斐波那契数列

1. def fboo(n):
2. # 递归，若n为1或2返回1，否则返回前两项和
3. return 1 if n == 1 or n == 2 else fboo(n-1) + fboo(n-2)
4. n = int(input())
5. print(fboo(n))