input: Write a function to check if a given number is prime or composite. The function should return True if the number is prime and False if it is composite. If the given number is 0 or 1, the function should also return False.
  
  def check_prime(num):
      if num <= 1:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  assert check_prime(10) == False
  assert check_prime(7) == True
  assert check_prime(1) == False
  assert check_prime(0) == False
  assert check_prime(13) == True
output: def check_prime(num):
      if num <= 1:
          return False
      for i in range(2, int(num**0.5) + 1):
          if num % i == 0:
              return False
      return True