input: Write a function to identify if a provided number is prime or composite. If the number is prime, return True; otherwise, return False. If the input number is 1, return False as 1 is neither prime nor composite. If the input number is less than 1, raise a ValueError.
  assert is_prime(2) == True
  assert is_prime(10) == False
  assert is_prime(1) == False
  assert is_prime(0) == False
  assert is_prime(-5) == False
output: def is_prime(n):
      if n < 1:
          raise ValueError
      if n == 1:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True