def isPrime(num):
	# If given number is greater than 1 
	if num > 1: 
	      
	   # Iterate from 2 to n / 2  
	   for i in range(2, num//2):          
	       # If num is divisible by any number between  
	       # 2 and n / 2, it is not prime  
	       if (num % i) == 0: 
	          return False
	   else: 
	       return True
	else: 
	   return False


print(isPrime(4))

primeList = []

for x in range(1,100):
	if isPrime(x):
		primeList.append(x)

print(primeList)