Problem:
Prime Numbers A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7. Write a program which reads a list of N integers and prints the number of prime numbers in the list. Input The first line contains an integer N , the number of elements in the list.  N numbers are given in the following lines. Output Print the number of prime numbers in the given list. Constraints 1 ≤ N ≤ 10000 2 ≤ an element of the list ≤ 10 8  Sample Input 1 5
2
3
4
5
6 Sample Output 1 3 Sample Input 2 11
7
8
9
10
11
12
13
14
15
16
17 Sample Output 2 4

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
import datetime as kim
from _heapq import heappush, heappop
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
N = int(input())
not_prime = 0
 
for loop in range(N):
    num = int(input())
 
    if num%2 == 0:
        if num != 2:
            not_prime += 1
    else:
        for i in range(3,num,2):
            if i*i > num:
                break
            if num%i == 0:
                not_prime += 1
                break
 
print("%d"%(N-not_prime))

Solution (Python):
def p(n):
  if n==2:
    return 1
  if not n&1: 
    return 0
  return pow(2,n-1,n)==1
print(sum(1 for _ in range(int(input())) if p(int(input()))))

Solution (Python):
def is_prime(x):
    if x==2:
        return 1
    if x<2 or x%2==0:
        return 0
    i=3
    while i<=x**0.5:
        if x%i==0:
            return 0
        i+=2
    return 1

n=int(input())
a=[int(input()) for i in range(n)]
c=0
for i in range(n):
    c+=is_prime(a[i])
print(c)

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
import datetime as kim
from _heapq import heappush, heappop
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
N = int(input())
not_prime = 0
 
for loop in range(N):
    num = int(input())
 
    if num%2 == 0:
        if num != 2:
            not_prime += 1
    else:
        for i in range(3,num,2):
            if i*i > num:
                break
            if num%i == 0:
                not_prime += 1
                break
 
print("%d"%(N-not_prime))

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
import datetime as kim
from _heapq import heappush, heappop
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
N = int(input())
not_prime = 0
 
for loop in range(N):
    num = int(input())
 
    if num%2 == 0:
        if num != 2:
            not_prime += 1
    else:
        for i in range(3,num,2):
            if i*i > num:
                break
            if num%i == 0:
                not_prime += 1
                break
 
print("%d"%(N-not_prime))

Solution (Python):
import heapq
from collections import deque
from enum import Enum
import sys
import math
import datetime as kim
from _heapq import heappush, heappop
 
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
 
 
N = int(input())
not_prime = 0
 
for loop in range(N):
    num = int(input())
 
    if num%2 == 0:
        if num != 2:
            not_prime += 1
    else:
        for i in range(3,num,2):
            if i*i > num:
                break
            if num%i == 0:
                not_prime += 1
                break
 
print("%d"%(N-not_prime))

Solution (Python):
import math

def is_prime(n):
  for i in range(2, int(math.sqrt(n)) + 1):
    if n % i == 0:
      return False
  return True

n = int(input())
a = [int(input()) for _ in range(n)]
print(sum([1 if is_prime(i) else 0 for i in a]))

Solution (Python):
import math

def isPrime(n):  
    if n == 2:
        return True
    if n < 2 or n % 2 == 0:
        return False
    i = 3
    while i <= math.sqrt(n):
        if n % i == 0:
            return False
        i += 2
    return True

n = int(input())
cnt = 0
for i in range(n):
    num = int(input())
    if isPrime(num):
        cnt += 1
print(cnt)

Solution (Python):
import math
n = int(input())
cnt = 0

def f(x):
    for i in range(2, int(math.sqrt(x))+1):
        if x%i == 0:
            return 0
    return 1

for i in range(n):
  m = int(input())
  cnt = cnt + f(m)

print(cnt)

Solution (Python):
N = int(input())
A = [int(input()) for _ in range(N)]

def iseven(a):
	return (a & 1) == 0

def isprime(a):
	if a == 0 or a == 1:
		return False
	if a == 2:
		return True
	if iseven(a):
		return False
	for n in range(3, int(a ** 0.5) + 1, 2):
		if a % n == 0:
			return False
	return True

count = 0
for a in A:
	count += isprime(a)

print(count)

Solution (Python):
primes=[]
def getprime():
    for i in range(2,10000):
        ok=True
        for p in primes:
            if i%p==0:
                ok=False
        if ok:
            primes.append(i)
 
def check(n):
    for p in primes:
        if n<=p:
            return True
        if n%p==0:
            return False
    return True
 
getprime()
n=int(input())
ns=[]
ans=0
for i in range(n):
    a=int(input())
    if check(a):
        ans+=1
print(ans)

Solution (Python):
import math

def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1

cnt = 0
for _ in range(int(input())):
    if(is_prime(int(input()))):
        cnt += 1
print(cnt)

Solution (Python):
def p(n):
    if n==2:return 1
    if not n&1:return 0
    return pow(2,n-1,n)==1
print(sum(1 for _ in range(int(input())) if p(int(input()))))

Solution (Python):
import math
class prime_number:
    def __init__(self,N,num):
        self.N=N
        self.num=num

    def judge(self):
        if self.num==2:
            return 'true'
        elif self.num<2 or self.num%2==0:
            return 'false'
        else:
            root=math.floor(math.sqrt(self.num))+1
            for j in range(3,root,2):
                if self.num%j==0:
                    return 'false'
            return 'true'


N=int(input())
count=0

for i in range(N):
    x=int(input())
    prime=prime_number(N,x)
    if prime.judge()=='true':
        count=count+1
    else:
        count=count
print(count)

Solution (Python):
import math

def is_prime(x):
    if x == 2:
        return True
    
    if x%2 == 0:
        return False

    for i in range(3, int(math.sqrt(x))+1, 2):
        if x%i == 0:
            return False

    return True


if __name__ == "__main__":
    input_count = int(input())

    prime_count = 0
    for i in range(input_count):
        num = int(input())
        if is_prime(num) == True:
            prime_count += 1
            
    print(prime_count)

Solution (Python):
def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q&1 == 0: return False
    return pow(2, q-1, q) == 1

if __name__ == '__main__':
    counter = 0
    N = int(input()) 
    for i in range(N):
        if is_prime(int(input())):
            counter += 1
    print(str(counter))

Solution (Python):
import math

def isPrime(n):
    for i in range(2, int(math.sqrt(n) + 1)):
        if n%i == 0:
            return False
    return True

if __name__=='__main__':
    N = int(input())
    _ = 0
    for i in range(N):
        if isPrime(int(input())):
            _ += 1
    print(_)

Solution (Python):
import math


def is_prime(n: int) -> bool:
    if n == 2 or n == 3:
        return True
    for i in range(2, int(math.sqrt(n) + 1)):
        if n % i == 0:
            return False
    return True


if __name__ == "__main__":
    num = int(input())
    total_prime_number_count = 0
    for _ in range(num):
        if (is_prime(int(input()))):
            total_prime_number_count += 1
    print(f"{total_prime_number_count}")

Solution (Python):
import math
def isprime(x):
    if x == 2:
        return True
    
    if x < 2 or x % 2 == 0:
        return False
    
    i = 3
    while i <= math.sqrt(x):
        if x % i == 0:
            return False
        i = i + 2
    return True

def eratos(n):
    isprime = [True for i in range(n+1)]
    isprime[0] = False
    isprime[1] = False
    for i in range(2, int(math.sqrt(n))+1):
        if isprime[i]:
            j = i + i
        while j <= n:
            isprime[j] = False
            j = j + i
    return isprime        

if __name__ == "__main__":
    
    n = int(input())
    ans = 0
    
    for i in range(n):
        x = int(input())
        ans += int(isprime(x))
        

    print(ans)

Solution (Python):
n = int(input())
A = [int(input()) for a in range(n)]
count = 0
for i in A:
    if i == 2:
        count += 1
        continue
    if i <= 1 or i%2 == 0:
        continue
    
    j = 3
    while(j*j < i):
        if i%j == 0:
            break
        j += 2
    
    if j*j > i:
        count += 1
        
print(count)

Solution (Python):
def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x%2==0:
        return False
    i = 3
    while i <= x**(0.5):
        if x%i==0:
            return False
        i+=2
    return True
 
if __name__=='__main__':
    N=int(input())
    cnt=0
    for _ in range(N):
        if is_prime(int(input())): cnt+=1
    print(cnt)

Solution (Python):
import math
  
def prime(num):
  if num==1 or num==2 or num==3:
    return True
  for i in range(2,int(math.sqrt(num))+1):
    if num%i==0:
      return False
  else:
    return True
  
n=int(input())
ans=0
for i in range(n):
  tmp=int(input())
  if prime(tmp):
    ans+=1
print(ans)

Solution (Python):
import math

def isprime(x):
	if x == 2:
		return 1
	if x <2 or x%2 ==0:
		return 0
	i=3
	while i <= math.sqrt(x):
		if x%i==0:
			return 0
		i+=2
	return 1
	
n=int(input())
num=0

for i in range(n):
	x=int(input())
	num+=isprime(x)
print(num)

Solution (Python):
from math import sqrt
from sys import stdin
N = int(stdin.readline().rstrip())
nums = [int(stdin.readline().rstrip()) for _ in range(N)]

def is_prime(x):
    if x == 2:
        return True

    if x < 2 or x % 2 == 0:
        return False

    i = 3
    while i <= sqrt(x):
        if x % i == 0:
            return False
        i = i + 2
    
    return True

print(sum(is_prime(n) for n in nums))

Solution (Python):
def is_prime(x):
    if x == 2:
        return True
    for i in range(2, int(x**0.5) + 1):
        if x % i == 0:
            return False
    return True


if __name__ == '__main__':
    n = int(raw_input())
    cnt = 0
    for i in range(n):
        x = int(raw_input())
        if is_prime(x):
            cnt += 1
    print cnt

Solution (Python):
def isPrime(n):
    for i in range(2, n):
        if i * i > n:
            return 1
        if n % i == 0:
            return 0
    return 1
 
ans = 0
n = int(input())
for i in range(n):
    x = int(input())
    ans = ans + isPrime(x)
 
print(ans)

Solution (Python):
import math

def isprime(x):
    if x == 2:
        return True
    
    if x < 2 or x % 2 == 0:
        return False
    
    i = 3
    while i <= math.sqrt(x):
        if x % i == 0:
            return False
        i += 2
    
    return True

cnt = 0

n = int(input())

for i in range(n):
    x = int(input())
    if isprime(x) == True:
        cnt += 1
print(cnt)

Solution (Python):
import math

n = int(input())
res = 0

for _ in range(n):
    k = int(input())
    for j in range(2, int(math.sqrt(k)) + 1):
        if k % j == 0:
            break
    else:
        res += 1

print(res)

Solution (Python):
n=int(input())
cnt=0
for i in range(n):
    a=int(input())
    ans=True
    for j in range(2,int(a**0.5)+1):
        if a%j==0:
            ans=False
            break
    if ans:
        cnt+=1
print(cnt)

Solution (Python):
n = int(input())
c=0


def is_prime(q):
    q = abs(q)
    if q == 2:
        return True
    if q < 2 or q&1 == 0:
        return False
    return pow(2, q-1, q) == 1

for i in range(n):
    m = int(input())
    if is_prime(m)==1:
        c+=1

print(c)

Solution (Python):
n = int(input())
def isPrime(x):
    if x == 2:
        return True
    if x < 2 or x%2 == 0:
        return False
    i = 3
    while i < int(x**0.5)+1:
        if x % i == 0:
            return False
        i += 2
    return True

ans = 0
for _ in range(n):
    num = int(input())
    ans += isPrime(num)
print(ans)

Solution (Python):




import math

def isprime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    i = 3
    while i <= math.sqrt(x):
        if x % i == 0:
            return False
        i += 2
    return True

n = int(input())
count = 0
for _ in range(n):
    if isprime(int(input())):
        count += 1
print(count)

Solution (Python):
n = int(input())
arr = [int(input()) for _ in range(n)]

primes = set(i for i in range(2, 10 ** 4))
for i in range(2, 101):
    if i in primes:
        primes.difference_update(range(i * i, 10 ** 4 + 1, i))

res = 0
for ele in arr:
    for p in primes:
        if ele > p and ele % p == 0:
            break
    else:
        res += 1

print(res)

Solution (Python):
n=int(input())
data=[]
for i in range(n):
    data.append(int(input()))
ans=n
for i in data:
    j=2
    while j*j<=i:
        if i%j==0:
            ans-=1
            break
        j+=1

print(ans)

Solution (Python):
n = int(input())
ans = 0
for _ in range(n):
	a = int(input())
	for i in range(2,int(a**0.5)+2):
		if i==int(a**0.5)+1:
			ans+=1
		if a%i==0:
			break
print(ans)

Solution (Python):
import math
n=int(input())
i=0
c=0
while i<n:
    m=int(input())
    sq=int(math.sqrt(m))
    j=2
    while j<=sq:
        if m%j==0:
            break
        else:
            j+=1
    if j>sq:
        c+=1
    i+=1
print(c)

Solution (Python):
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973]

def check_prime(num):
    return all([num%k for k in primes if k < num])

input_line = input()
n = int(input_line)
ret = 0
for _ in range(n):
    input_line = input()
    z = int(input_line)
    if check_prime(z): 
        ret += 1

print(ret)

Solution (Python):
import math

n = int(input())

count = 0

def isPrimeNumber(x):
    if x == 2:
        return True
    elif x % 2 == 0:
        return False

    for i in range(3, int(math.sqrt(x)) + 2, 1):
        if x % i == 0:
            return False
    return True

for i in range(n):
    x = int(input())
    if isPrimeNumber(x):
        count += 1

print(count)

Solution (Python):


length = int(input())
List = [int(input()) for i in range(length)]

def isPrime(n):
    if n == 2:
        return True
    elif n < 2 or n % 2 == 0:
        return False
    else:
        i = 3
        while i <= n**(1/2):
            if n % i == 0:
                return False
            else:
                i = i + 2
        else: return True

count = 0

for j in range(length):
    if isPrime(List[j]) is False:
        continue
    else:
        count = count + 1

print(count)

Solution (Python):
def IsPrime(n):
    for i in range(2,min(9997,n)):
        if n%i==0:
            return False
    return True


n=int(input())
da=[int(input()) for i in range(n)]
co=0
for i in da:
    if IsPrime(i):
        co+=1
print(co)

Solution (Python):
def checkPrime(n):
    m = 2
    max = n
    while m < max:
        if n%m == 0:
            return False
        else:
            max = n//m
            m += 1
    return True

n = int(input())
cnt = 0
for ni in range(n):
    num = int(input())
    if checkPrime(num):
        cnt += 1
print(cnt)

Solution (Python):
def isprime(x):
    if x == 2:
        return True

    if ((x < 2) or
        (x % 2 == 0)):
        return False

    i = 3
    while i ** 2 <= x:
        if x % i == 0:
            return False
    
        i = i + 2
    
    return True


n = int(input())

cnt = 0

for _ in range(n):

    num_input = int(input())

    if isprime(num_input):
        cnt += 1


print(cnt)

Solution (Python):
import math


def isprime(x):
    if x == 2:
        return 1
    elif x < 2:
        return 0
    elif x % 2 == 0:
        return 0
    else:
        for i in range(2, int(math.sqrt(x))+1):
            if x % i == 0:
                return 0
    return 1


if __name__ == "__main__":    
    n = int(input())
    n_list = []
    for _ in range(n):
        n_list.append(int(input()))
    cnt = 0
    for num in n_list:
        cnt += isprime(num)
    print(cnt)

Solution (Python):
import math

def isPrime(n):
    if n == 1:
        return False
    elif n == 2:
        return True
    elif n % 2 == 0:
        return False

    for i in range(3, int(math.sqrt(n))+1, 2):
        if n % i == 0:
            return False
    else:
        return True

n = int(input())

numbers = []
for i in range(n):
  numbers.append(int(input()))

sum = 0
for i in numbers:
    if isPrime(i):
        sum += 1

print (sum)

Solution (Python):
import math

def isPrime(n):
  x = int(math.sqrt(n))
  for i in range(2, x+1):
    if n % i == 0:
      return False
      break
  
  return True
  

n = int(input())
cnt = 0
for i in range(n):
  a = int(input())
  if isPrime(a):
    cnt += 1
print(cnt)

Solution (Python):
import math

N = int(input())
a = [int(input()) for _ in range(N)]


count = N
for x in a:
    if x != 2 and x % 2 == 0:
        count -= 1
        continue
    n = int(math.sqrt(x))
    for i in reversed(range(3, n+1, 2)):
        if x % i == 0:
            count -= 1
            break
print(count)

Solution (Python):
def check_prime_number(num):
	if num == 1:
		return 0

	for i in range(2,int(num**0.5)+1):	
		if num % i == 0:
			return 0
	return 1

if __name__ == '__main__':
	num = int(input())
	c = 0
	for i in range(num):
		d = int(input())
		c += check_prime_number(d)
	print(c)

Solution (Python):
num = int(input())
count = 0
for i in range(num):
    a = int(input())
    j = 2
    d = 0
    while (j <= a//j):
        r = a%j
        if r == 0:
            d += 1
            break
        elif j == 2:
            j += 1
        else:
            j += 2
    if d == 0:
        count += 1
print(count)

Solution (Python):
n = int(input())
s = []
while(n>0):
    s.append(int(input()))
    
    n -= 1

import math
num = 0
for i in range(len(s)):
    isPrime = True
    if(s[i] == 2 or s[i] == 3):
        num += 1
    
    half = s[i]//2 + 1
    
    rm = int(math.sqrt(s[i]))
    
    for j in range(2,rm+1):
        if(s[i] % j == 0):
            isPrime == False
            break
    
        if(j == rm and isPrime == True):
            num += 1
print(num)

Solution (Python):
def isPrime(n):
    for i in range(2, n):
        if i * i > n:
            return 1
        if n % i == 0:
            return 0
    return 1
  
ans = 0
n = int(input())
for i in range(n):
    x = int(input())
    ans = ans + isPrime(x)
  
print(ans)

Solution (Python):
def isPrime(n):
    for i in range(2, n):
        if i * i > n:
            return 1
        if n % i == 0:
            return 0
    return 1
 
ans = 0
n = int(input())
for i in range(n):
    x = int(input())
    ans = ans + isPrime(x)
 
print(ans)

Solution (Python):
import math
def is_prime(a):
    for i in range(2,int(math.sqrt(a))+1):
        if a%i==0:
            return False
    return True

n = int(input())
cnt = 0
for i in range(n):
    x = int(input())
    if is_prime(x):
        cnt+=1
print(cnt)

Solution (Python):
num = 0

n = int(input())
for _ in range(n):
    x = int(input())
    z = 1
    if x == 2:
        z = 1
        num += 1
        continue
    elif x < 1 or x % 2 == 0:
        continue
    y = int(x**0.5)
    for v in range(3, y+1, 2):
        if x % v == 0:
            z = 0
            break
    if z == 1:
        num += 1

print(num)

Solution (Python):
import math

def is_prime(num):
    for i in range(2, int(math.sqrt(num))+1):
        if num % i == 0:
            return False
    return True

n = int(input())
counter = 0
for _ in range(n):
    test_num = int(input())
    if is_prime(test_num):
        counter += 1
print(counter)

Solution (Python):
import math
cnt=0
for i in range(int(input())):
	num=int(input())
	flag=True
	for j in range(2,int(math.sqrt(num))+1):
		if num%j==0:
			flag=False
			break
	if flag==True:
		cnt+=1		
print(cnt)

Solution (Python):
n = int(input())
count = 0
for i in range(n):
    flag = 0
    N = float(input())
    if N == 1:
        flag = 1
    
    if N > 2 and N%2 == 0:
        flag = 1
    
    for j in range(2, int(1+N**0.5)):
        if flag == 1:
            break
        if float(N%(j)) == 0:
            flag = 1
    
    if flag == 0:
        count += 1

print(count)

Solution (Python):
c = 0
for _ in range(int(input())):
	m = int(input())
	if m == 2 or (m % 2 and pow(2, m-1, m) == 1):
		c += 1
print(c)

Solution (Python):
import math

def isprime(n):
    i = 2
    while i <= math.sqrt(n):
        if n % i == 0:
            return False
        i += 1
    
    return True

N = int(input())
lst = []
j = 0

for i in range(N):
  d = int(input())
  if isprime(d):
    j += 1

print(j)

Solution (Python):
n = int(input())
ans = 0

for _ in range(n):
    v = int(input())
    if v == 2:
        ans += 1
    elif v % 2 > 0:
        i = 3
        p = False
        while (i*i) <= v:
            if v % i == 0:
                p = True
                break
            i += 2
        if not p:
            ans += 1
print(ans)

Solution (Python):
import math

n = int(input())
no_sosu = 0

for i in range(n):
    s = int(input())
    
    if s%2 == 0:
        if s != 2:
            no_sosu += 1

    else:
        for j in range(3,s,2):
            if j**2 > s:
                break
            if s%j == 0:
                no_sosu += 1
                break

print(n-no_sosu)