Baekjoon #1978

#include<bits/stdc++.h>

using namespace std;

bool isPrime(int x) {
    if(x <= 1) return false;
    for(int i=2;i*i<=x;i++) {
        if(x % i == 0) return false;
    }
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    int answer = 0;
    for(int i=0;i<n;i++){
        int x; cin >> x;
        if(isPrime(x)) answer ++;
    }
    cout << answer;

    return 0;
}

import sys
from math import sqrt

def input():
    return sys.stdin.readline().rstrip()

prime = [1] * 1005
prime[0] = 0
prime[1] = 0
ct = 0
N = int(input())
arr = list(map(int, input().split()))
for i in range(2, int(sqrt(1005))+1):
    for j in range(i+i, 1005, i):
        if prime[j] == 1:
            prime[j] = 0
for i in arr:
    if prime[i]:
        ct += 1
print(ct)