#include <iostream>
#include <math.h>
using namespace std;
bool primeNumber(int num) {
float root = sqrt(num);
if (num <= 1) {
return false;
}
else if (num == 2 || num == 3) {
return true;
}
else {
for (int i = 2; i <= root; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
}
int main() {
int num, inputNum, count = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> inputNum;
if (primeNumber(inputNum)) {
count++;
}
}
cout << count;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWF0aC5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKYm9vbCBwcmltZU51bWJlcihpbnQgbnVtKSB7CiAgICBmbG9hdCByb290ID0gc3FydChudW0pOwogICAgaWYgKG51bSA8PSAxKSB7CiAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgfQogICAgZWxzZSBpZiAobnVtID09IDIgfHwgbnVtID09IDMpIHsKICAgICAgICByZXR1cm4gdHJ1ZTsKICAgIH0KICAgIGVsc2UgewogICAgICAgIGZvciAoaW50IGkgPSAyOyBpIDw9IHJvb3Q7IGkrKykgewogICAgICAgICAgICBpZiAobnVtICUgaSA9PSAwKSB7CiAgICAgICAgICAgICAgICByZXR1cm4gZmFsc2U7CiAgICAgICAgICAgIH0gIAogICAgICAgIH0KICAgICAgICByZXR1cm4gdHJ1ZTsKICAgIH0KICAgIAp9CgoKaW50IG1haW4oKSB7CgogICAgaW50IG51bSwgaW5wdXROdW0sIGNvdW50ID0gMDsKICAgIGNpbiA+PiBudW07CiAgICAKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbnVtOyBpKyspIHsKICAgICAgICBjaW4gPj4gaW5wdXROdW07CiAgICAgICAgaWYgKHByaW1lTnVtYmVyKGlucHV0TnVtKSkgewogICAgICAgICAgICBjb3VudCsrOwogICAgICAgIH0KICAgIH0KICAgIGNvdXQgPDwgY291bnQ7Cn0=