def isPrim(n):
for i in range(2,sqrt(n)):
if n%i==0:
return False
return True
def countPrim(n):
isPrim = [[True]*n for _ in range(n)]
for i in range(2,sqrt(n)):
if isPrim[i]:
for i in range(i**2,n,i):
isPrim[j]=False
count = 0
for i in range(2,n):
if isPrim[i]:
count+=1
return count