#include <bits/stdc++.h>
static const int N = 10000;
int main() {
  int n, i, j, count = 0, net;
  int Prime[N + 1];
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &Prime[i]);
  for (i = 0; i < n; i++) {
    for (j = 2; j < Prime[i]; j++) {
      if (Prime[i] % j == 0) {
        net = 777;
        break;
      }
    }
    if (Prime[i] == 2)
      count++;
    else if (net == 0)
      count++;
    net = 0;
  }
  printf("%d\n", count);
  return 0;
}
