input: Write a function to check if a given number is prime. The function should take an integer as an input and return True if the number is prime, otherwise return False. If the input number is less than or equal to 1, the function should return False.
  assert primeCheck(2)==True
  assert primeCheck(3)==True
  assert primeCheck(4)==False
  assert primeCheck(7)==True
  assert primeCheck(1)==False
  assert primeCheck(0)==False
  assert primeCheck(-1)==False
output: def primeCheck(n):
      if n <= 1:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True