#include<bits/stdc++.h>
using namespace std;
#define MAX 1000002
int arr[MAX];
bool vis[MAX],invis[MAX];
void solve()
{
int i,j,n,cnt=0,mx=0;
cin>>n;
for(i=0;i<n;++i)
{
cin>>arr[i];
invis[arr[i]]=1;
mx=max(mx,arr[i]);
}
sort(arr,arr+n);
for(i=0;i<n;++i)
{ bool flag=0;
if(vis[arr[i]])
continue;
for(j=2*arr[i]; j<=mx; j+=arr[i])
{
if(invis[j])
vis[j]=1,flag=1;
}
if(flag)
vis[arr[i]]=1;
}
for(i=0;i<n;++i)
if(!vis[arr[i]])++cnt;
cout<<cnt;
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
solve();
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBNQVggMTAwMDAwMgppbnQgYXJyW01BWF07CmJvb2wgdmlzW01BWF0saW52aXNbTUFYXTsKdm9pZCBzb2x2ZSgpCnsKCmludCBpLGosbixjbnQ9MCxteD0wOwpjaW4+Pm47CmZvcihpPTA7aTxuOysraSkKewogICAgY2luPj5hcnJbaV07CiAgICBpbnZpc1thcnJbaV1dPTE7CiAgICBteD1tYXgobXgsYXJyW2ldKTsKfQoKc29ydChhcnIsYXJyK24pOwoKZm9yKGk9MDtpPG47KytpKQp7ICAgYm9vbCBmbGFnPTA7CgogICAgaWYodmlzW2FycltpXV0pCiAgICAgICAgY29udGludWU7CgogICAgZm9yKGo9MiphcnJbaV07IGo8PW14OyBqKz1hcnJbaV0pCiAgICB7CiAgICAgICAgaWYoaW52aXNbal0pCiAgICAgICAgICAgIHZpc1tqXT0xLGZsYWc9MTsKICAgIH0KICAgIGlmKGZsYWcpCiAgICAgICAgdmlzW2FycltpXV09MTsKfQpmb3IoaT0wO2k8bjsrK2kpCiAgICBpZighdmlzW2FycltpXV0pKytjbnQ7Cgpjb3V0PDxjbnQ7Cn0KaW50IG1haW4oKQp7Cmlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCksY2luLnRpZSgwKSxjb3V0LnRpZSgwKTsKc29sdmUoKTsKfQo=