input: Write a function to determine if a provided number is prime or composite. The function should return "Prime" if the number is prime and "Composite" if the number is composite. If the number is less than 2, return "Invalid".
  assert is_prime_or_composite(10) == "Composite"
  assert is_prime_or_composite(7) == "Prime"
  assert is_prime_or_composite(1) == "Invalid"
  assert is_prime_or_composite(2) == "Prime"
  assert is_prime_or_composite(-5) == "Invalid"
output: def is_prime_or_composite(n):
      if n < 2:
          return "Invalid"
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return "Composite"
      return "Prime"