input: Write a function to display a Fibonacci sequence of the first n numbers. The function should take an integer n as input and print the first n Fibonacci numbers, starting from 0 and 1. If n is less than or equal to 0, the function should print an empty sequence. If n is exactly 1, it should print only the first Fibonacci number, which is 0.
  def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_sequence = [0, 1]
          for i in range(2, n):
              fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
          return fib_sequence
  
  n = 10
  print(Fibonacci(n))
  assert Fibonacci(5) == [0, 1, 1, 2, 3]
  assert Fibonacci(1) == [0]
  assert Fibonacci(0) == []
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
output: def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_sequence = [0, 1]
          for i in range(2, n):
              fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
          return fib_sequence