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__':
    i = 0
    N = int(input())
    a = []
    for j in range(N):
        a.append(int(input()))
        if(is_prime(a[j])) == True:
            i += 1
    print(i) 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 is_prime q = abs(q) q abs(q) abs q if q == 2: return True
     q == 2 q 2 if q < 2 or q&1 == 0: return False
     q < 2 or q&1 == 0 q < 2 q 2 q&1 == 0 q&1 q 1 0 return pow(2, q-1, q) == 1 pow(2, q-1, q) == 1 pow(2, q-1, q) pow 2 q-1 q 1 q 1 q q if __name__ == '__main__':
    i = 0
    N = int(input())
    a = []
    for j in range(N):
        a.append(int(input()))
        if(is_prime(a[j])) == True:
            i += 1
    print(i) __name__ == '__main__' __name__ '__main__' i = 0 i 0 N = int(input()) N int(input()) int input() input a = [] a [] for j in range(N):
        a.append(int(input()))
        if(is_prime(a[j])) == True:
            i += 1
     j range(N) range N a.append(int(input())) a.append a append int(input()) int input() input if(is_prime(a[j])) == True:
            i += 1
     (is_prime(a[j])) == True is_prime(a[j]) is_prime a[j] a j True i += 1 i 1 print(i) print i a = [] [] a i += 1 1 i N = int(input()) int(input()) N 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 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 is_prime i = 0 0 i
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__':
    i = 0
    N = int(input())
    a = []
    for j in range(N):
        a.append(int(input()))
        if(is_prime(a[j])) == True:
            i += 1
    print(i)