input: Write a function to generate a Fibonacci sequence of the first n numbers. If n is 1, return the sequence with only the first number; if n is 2, return the sequence with the first and second numbers; otherwise, return the sequence with the first n numbers.
  
  def Fibonacci(n):
      if 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
  
  assert Fibonacci(1) == [0]
  assert Fibonacci(2) == [0, 1]
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
  assert Fibonacci(0) == []
  assert Fibonacci(-1) == []
output: def Fibonacci(n):
      if 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