#include <bits/stdc++.h>

#define MOD 66013

using namespace std;

ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");

int Q;
set<int> H2,H3,H5,H7,H11;

int decomp(int N,int k)
{
    int p=0;
    while(N%k==0)
        p++, N/=k;
    return p;
}

int main()
{
    for(int i=1;i<=276997;i++)
    {
        int N;
        fin>>N;
        H2.insert(decomp(N,2));
        H3.insert(decomp(N,3));
        H5.insert(decomp(N,5));
        H7.insert(decomp(N,7));
        H11.insert(decomp(N,11));
    }
    return 0;
    fin>>Q;
    int ans=0;
    while(Q--)
    {
        int x;
        fin>>x;
        bool ok2=H2.find(decomp(H,2))!=H2.end();
        bool ok3=H3.find(decomp(H,3))!=H3.end();
        bool ok5=H5.find(decomp(H,5))!=H5.end();
        bool ok7=H7.find(decomp(H,7))!=H7.end();
        bool ok11=H11.find(decomp(H,11))!=H11.end();
        ans+=ok2&&ok3&&ok5&&ok7&&ok11;
    }
    fout<<ans;
    return 0;
}