input: Write a function to determine if a given number is prime or composite. If the number is prime, return "Prime"; otherwise, return "Composite". If the number is less than 2, return "Neither".
  
  assert is_prime(10) == "Composite"
  assert is_prime(13) == "Prime"
  assert is_prime(1) == "Neither"
  assert is_prime(0) == "Neither"
  assert is_prime(-7) == "Neither"
output: def is_prime(n):
      if n < 2:
          return "Neither"
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return "Composite"
      return "Prime"