#include <fstream>
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
unsigned long long int i,j,n,m,a,b,k,x,lx,ly,c,mini;
char cc[100];
int main()
{
    fin.get(cc,100);
    fin >> n;
    for(i = 1; i <= n; i++)
    {
        fin >> a;
        while(a%2==0)
            a/=2;
        while(a%3==0)
            a/=3;
        while(a%5==0)
            a/=5;
        while(a%7==0)
            a/=7;
        while(a%11==0)
            a/=11;
        if(a == 1)
            m++;
    }
    fout << m;
    return 0;
}