def isPrime(n):
if n <= 1:
return False
i = 2
while i * i <= n:
if n % i == 0:
i += 1
return True
li = []
n = 0
m = 1
while n < 100:
if isPrime(m):
li.append(m)
n += 1
m += 1
print(li,len(li))
