#include<iostream>#include<cstring>#include<vector>#include<stdio.h>#include<queue>#include<math.h>#include<stack>#include<algorithm>#include<map>#include<set>#include<iostream>
using namespace std;#define MAX 99999999typedeflonglong ll;int n,m,k;constint mmax =1e6;int visi[mmax];intmain(){
cin>>n;int a[n +1];for(int i =0; i < n ; i++)
cin>>a[i];sort(a,a+n);int cnt =0;for(int i =0; i < n ; i++){
if(visi[a[i]]==0){
if(a[i]!=a[i+1])
cnt++;for(int j =1;j*a[i]<=mmax;j++)
visi[j*a[i]]=1;}}
cout<<cnt;return0;}