input: Write a function to generate a Fibonacci sequence of the first n numbers and print each element in the sequence. If n is less than or equal to 0, return an empty list.
  assert Fibonacci(1) == [0]
  assert Fibonacci(2) == [0, 1]
  assert Fibonacci(5) == [0, 1, 1, 2, 3]
  assert Fibonacci(0) == []
  assert Fibonacci(-1) == []
output: def Fibonacci(n):
      if n <= 0:
          return []
      if n == 1:
          return [0]
      if n == 2:
          return [0, 1]
      fib_seq = [0, 1]
      for i in range(2, n):
          fib_seq.append(fib_seq[-1] + fib_seq[-2])
      return fib_seq