input: Write a function to generate a Fibonacci sequence of the first n numbers and print each number in the sequence. If n is less than or equal to 0, the function should return an empty list.
  
  def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      sequence = [0, 1]
      for i in range(2, n):
          sequence.append(sequence[-1] + sequence[-2])
      return sequence
  
  n = 10
  fib_sequence = Fibonacci(n)
  for num in fib_sequence:
      print(num)
  
  assert Fibonacci(0) == []
  assert Fibonacci(1) == [0]
  assert Fibonacci(2) == [0, 1]
  assert Fibonacci(5) == [0, 1, 1, 2, 3]
  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]
      sequence = [0, 1]
      for i in range(2, n):
          sequence.append(sequence[-1] + sequence[-2])
      return sequence