# 方法一：递归

  num1 = int(input("输出第几个斐契那波数列数？").strip())

  def fib(n):

      if n == 0 or n == 1:

          return n

      else:

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

  print(fib(num1))

  ​

  # 方法二：循环的方法

  num2 = int(input("输出第几个斐契那波数列数？").strip())

  def fib2(n):

      a,b=0,1

      count = 1

      while count < n:

          a,b = b,a+b

          count = count + 1

      return b

  print(fib2(num2))

 def fib2(n):

      """迭代的方式，参数输入需要的斐波那契数列的第n项"""

      num1,num2 = 1,1

      for i in range(n-1):

          num1,num2 = num1+num2, num1

      return num1

  print([b[0] for b in [(a[-1], a.append(a[-1]+a[-2])) for a in ([1,1],) for i in range(100)]])