#include <bits/stdc++.h>

using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
int n, q, nr;
int prim[6] = {2, 3, 5, 7, 11};

int main()
{
    while(nr < 276997){
        fin >> n;
        nr++;
    }
    nr = 0;
    fin >> q;
    for(int i = 1; i <= q; i++){
        fin >> n;
        for(int j = 0; j <= 4; j++){
            while(n % prim[j] == 0){
                n /= prim[j];
            }
        }
        if(n == 1){
            nr++;
        }
    }
    fout << nr;
    return 0;
}