input: Write a function to display a Fibonacci sequence of the first n numbers. The function should return the Fibonacci number at the nth position. If n is 1, return 0. If n is 2, return 1. For all other values of n, return the sum of the two preceding ones.
  def Fibonacci(n):
      if n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          return Fibonacci(n-1) + Fibonacci(n-2)
  
  n = 10
  for i in range(1, n):
      print(Fibonacci(i))
  
  assert Fibonacci(1) == 0
  assert Fibonacci(2) == 1
  assert Fibonacci(3) == 1
  assert Fibonacci(4) == 2
  assert Fibonacci(5) == 3
  assert Fibonacci(6) == 5
  assert Fibonacci(7) == 8
  assert Fibonacci(8) == 13
  assert Fibonacci(9) == 21
output: def Fibonacci(n):
      if n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          return Fibonacci(n-1) + Fibonacci(n-2)