#include <bits/stdc++.h>
using namespace std;

const long long nmax = 1e6 ;
bool f[nmax + 5];
void snt()
{
  memset (f , true , sizeof(f));
  f[0] = f[1] = false;
  for (long long i = 2; i <= sqrt(nmax); ++i)
  if (f[i]) for (long long j = i * i; j <= nmax; j += i)
  f[j] = false;
}
long long tt;
set<long long> c;
int main()
{
  freopen("bai2.inp" , "r" , stdin);
  freopen("bai2.out" , "w" , stdout);
  ios::sync_with_stdio(false);
  cin.tie(0);
  snt();
  cin >> tt;
  while (tt--)
  {
    long long n;
    cin >> n;
    if (f[n]) c . insert(n);
  }
  cout << c . size();
  return 0;
}

#include<bits/stdc++.h>
using namespace std;

bool snt(int n){
    if (n < 2) return false;
    for (int i=2;i<=static_cast<int>(sqrt(n));++i) {
        if (n%i==0) return false;
    }
    return true;
}

int main(){
    int n;
    cin >> n;
    set<int> a;
    for (int i=0; i < n; ++i){
        int value;
        cin >> value;
        //meothinhle
        a.insert(value);
    }
    int s = 0;
    for (const auto& i : a){
        if (snt(i)) {
            s += 1;
        }
    }
    cout<<s ;
    return 0;
}