input: Write a function that checks if a given number is prime.
  
  ### Input:
  def primeCheck(num):
  
  ### Output:
  def primeCheck(num):
   if num > 1:
    for i in range(2, int(num**0.5) + 1):
     if (num % i) == 0:
      return False
    return True
   return False
      
  assert primeCheck(7) == True
  assert primeCheck(12) == False
  assert primeCheck(1) == False
  assert primeCheck(2) == True
  assert primeCheck(0) == False
output: def primeCheck(num):
   if num > 1:
    for i in range(2, int(num**0.5) + 1):
     if (num % i) == 0:
      return False
    return True
   return False