input: Write a function to check if a given number is prime or composite. Return "Prime" if the number is prime and "Composite" if the number is composite. If the given number is less than 2, return "Neither".
  assert check_prime(10)== "Composite"
  assert check_prime(3)== "Prime"
  assert check_prime(1)== "Neither"
  assert check_prime(0)== "Neither"
  assert check_prime(-5)== "Neither"
output: def check_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"