input: Write a python function to classify numbers as "Prime", "Even", "Odd", or "Composite".
  assert classify_numbers([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == ["Composite", "Prime", "Prime", "Even", "Prime", "Even", "Prime", "Even", "Odd", "Even"]
  assert classify_numbers([0, -1, 2, 15, 23, 24]) == ["Composite", "Composite", "Prime", "Odd", "Prime", "Even"]
  assert classify_numbers([11, 13, 17, 19]) == ["Prime", "Prime", "Prime", "Prime"]
output: def classify_numbers(numbers):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n ** 0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      def classify(n):
          if n <= 1:
              return "Composite"
          if is_prime(n):
              return "Prime"
          if n % 2 == 0:
              return "Even"
          return "Odd"
  
      return [classify(n) for n in numbers]