input: Write a function to display a Fibonacci sequence of the first n numbers. Implement the function such that it returns the nth Fibonacci number. Additionally, provide a loop to print the Fibonacci sequence for the first n numbers. If n is 1, return 0; if n is 2, return 1; otherwise, return the sum of the two preceding Fibonacci numbers.
  assert Fibonacci(3)==1
  assert Fibonacci(5)==3
  assert Fibonacci(10)==34
  n = 10
  for i in range(1, n):
      print(Fibonacci(i))
output: def Fibonacci(n):
      if n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          a, b = 0, 1
          for _ in range(3, n + 1):
              a, b = b, a + b
          return b