#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include<functional>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <stack>
#include <deque>
#include <tuple>
#include <float.h>
#include<time.h>

#define MOD 1000000007;
#define LL long long
#define pLL pair<LL,LL>
#define mp make_pair
#define mt make_tuple
#define pq priority_queue<LL>
#define pqg priority_queue<LL,vector<LL>,greater<LL>>
#define vecLL vector<LL>
#define vecpLL vector<pLL>
#define vecbL vector<bool>
#define mat vector<vecLL>
#define endl "\n"
#define REP(e,v) for(auto e:v)
#define rep(i, a, n) for(LL i = a; i < n;i++)
#define Arep(i, a, n) for(i = a; i < n;i++)

#define INF LLONG_MAX/2
#define DINF DBL_MAX/2
using namespace std;


/*↓マイライブラリ↓*/

//clock_t start = clock();
//
//clock_t end = clock();
//
//const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;
//printf("time %lf[ms]\n", time);

LL linp(){
	LL x;
	scanf("%lld",&x);
	return x;
}
template<typename T>
T numperm(T x,T y){
	T res = 1;
	for(T i = x; i >= y; i -= 1){
		res = res * i;
	}
	return res;
}

template<typename T>
T pow(T x,T y){

	if(y == 1){
		return x;
	}
	T res = pow(x*x,y/2);
	if(y % 2 == 0){
		return res;
	}
	else{
		return x*res;
	}
}

 template <LL mod>
 struct ModLL {
     LL x;
     ModLL() : x(0) {}
     ModLL(LL x_) {
         if ((x = x_ % mod + mod) >= mod) x -= mod;
     }
     ModLL& operator+=(ModLL rhs) {
         if ((x += rhs.x) >= mod) x -= mod;
         return *this;
     }

     ModLL& operator-=(ModLL rhs) {
         if ((x -= rhs.x) < 0) x += mod;
         return *this;
     }
     ModLL& operator*=(ModLL rhs) {
         x = (unsigned long long)x * rhs.x % mod;
         return *this;
     }
     ModLL& operator/=(ModLL rhs) {
         x = (unsigned long long)x * rhs.inv().x % mod;
         return *this;
     }

     ModLL operator-() const { return -x < 0 ? mod - x : -x; }
     ModLL operator+(ModLL rhs) const { return ModLL(*this) += rhs; }
     ModLL operator-(ModLL rhs) const { return ModLL(*this) -= rhs; }
     ModLL operator*(ModLL rhs) const { return ModLL(*this) *= rhs; }
     ModLL operator/(ModLL rhs) const { return ModLL(*this) /= rhs; }
     bool operator==(ModLL rhs) const { return x == rhs.x; }
     bool operator!=(ModLL rhs) const { return x != rhs.x; }
     ModLL inv() const { return pow(*this, mod - 2); }

     friend ostream& operator<<(ostream& s, ModLL<mod> a) {
         s << a.x;
         return s;
     }
     friend istream& operator>>(istream& s, ModLL<mod>& a) {
         s >> a.x;
         return s;
     }
 };

#define mLL ModLL<1000000007>
#define mvec vector<mLL>

 template<typename T>
 struct SquareMatrix{

     vector<vector<T>> dat;
     size_t N;
     SquareMatrix() = default;
     SquareMatrix(size_t N, T val = T()):N(N){
         dat = vector<vector<T>> (N, vector<T> (N));
         for(size_t i=0;i<N;i++)
             for(size_t j=0;j<N;j++)
                 dat[i][j]=val;
     }
     SquareMatrix& operator=(const SquareMatrix& a){
         dat=a.dat;
         return (*this);
     }
     bool operator==(const SquareMatrix& a) const{
         return dat==a.dat;
     }

     size_t size() const{return N;};
     vector<T>& operator[](size_t k){return dat[k];};
     const vector<T>& operator[](size_t k) const {return dat[k];};

     SquareMatrix operator*(const SquareMatrix &B) const{
         SquareMatrix res(N, 0);
         for(size_t i=0;i<N;i++)
             for(size_t j=0;j<N;j++)
                 for(size_t k=0;k<N;k++)
                     res[i][j]=res[i][j]+(dat[i][k]*B[k][j]);
         return res;
     }

     SquareMatrix operator+(const SquareMatrix &B) const{
         SquareMatrix res(N, 0);
         for(size_t i=0;i<N;i++)
             for(size_t j=0;j<N;j++)
                 res[i][j]=dat[i][j]+B[i][j];
         return res;
     }

     SquareMatrix operator-(const SquareMatrix &B) const{
              SquareMatrix res(N, 0);
              for(size_t i=0;i<N;i++)
                  for(size_t j=0;j<N;j++)
                      res[i][j]=dat[i][j]-B[i][j];
              return res;
          }

     SquareMatrix pow(long long n) const{
         SquareMatrix a=*this;
         SquareMatrix res(N, 0);
         for(size_t i = 0; i < N; i++) res[i][i] = 1;
         while(n){
             if(n&1) res=res*a;
             a=a*a;
             n>>=1;
         }
         return res;
     }
 };

#define mmat SquareMatrix<mLL>


vecLL bit(LL i,LL N){
	vecLL biti(N);

	rep(x,0,N){
		biti[N - 1 - x] = (i >> x) & 1;
	}

	return biti;
}
template<typename T>
void swap(T &a, T &b){
	T t = a;
	a = b;
	b = t;

	return ;
}

template<typename T>
T digit(T x,T n){
	LL count = 1;

	while(x >= n){
		x = x/n;
		count++;
	}
	return count;
}

template<typename T>
T gcd(T i,T j){
	if(j != 0)
		return gcd(j, i % j);
	else
		return i;
}

template<typename T>
bool isPrime(LL X){
	for(LL i = 2; i*i <= X;i++){
		if(X % i == 0){
			return false;
		}
	}
	return true;
}
template<typename T>
 vecLL Eratosthenes(LL n){//素数のベクトルを返す

	 bool isPrime[n];
	 fill(isPrime,isPrime+n,true);

	 isPrime[0] = isPrime[1] = false;
	 for(LL i = 2; i*i <= n;i++){
		 if(isPrime[i]){
			 for(LL j = 2*i ;j <= n ; j += i){
				 isPrime[j] = false;
			 }
		 }
	 }

	 vecLL P;

	 rep(i,2,n+1){
		 if(isPrime[i]){
			 P.push_back(i);
		 }
	 }

	 return P;
}

 map<LL,LL> factalization(LL N){
 	map<LL,LL> fac;
 	LL oriN = N;
 	LL div = 1;
 	for(LL i = 2;i*i <= N;++i){
 		while(N%i == 0){
 			fac[i]++;
 			div *= i;
 			N /= i;
 		}
 	}
 	if(oriN/div != 1){
 		fac[oriN/div]++;
 	}
 	return fac;
 }

 struct edge {//枝
	LL to,cost;
	double dcost;//コストが整数でない場合に使う
} ;


struct vertex{//頂点(枝付き)
	LL key;
	double dkey;//キーが整数でない場合に使う
	vector<edge> edges;//頂点から伸びる枝
};

class Graph{

public:

	LL V;//頂点数
	vertex* vertices;//グラフ


	Graph(LL v){//頂点数を指定してグラフの初期化
		V = v;//頂点数
		vertices = new vertex[V];//頂点集合

		rep(i,0,V){
			vertices[i].key = -1;//キー初期値は-1
			vertices[i].dkey = -1;//キー初期値は-1
		}

	}

	void setDE(LL i,LL j,LL cos){//i→jにコストcosの有向枝を加える

			edge e;
			e.to= j;
			e.cost = cos;

			vertices[i].edges.push_back(e);

			return;
	}

	void setDE(LL i,LL j,double dcos){//i→jにコストcosの有向枝を加える

				edge e;
				e.to= j;
				e.dcost = dcos;

				vertices[i].edges.push_back(e);

				return;
	}

	void setUDE(LL i,LL j,LL cos){//(i,j)にコストcosの無向枝を加える

		edge ei,ej;
		ei.to = j;
		ej.to = i;
		ei.cost = ej.cost = cos;

		vertices[i].edges.push_back(ei);
		vertices[j].edges.push_back(ej);

		return;
	}

	void setUDE(LL i,LL j,double dcos){//(i,j)にコストcosの無向枝を加える

		edge ei,ej;
		ei.to = j;
		ej.to = i;
		ei.dcost = ej.dcost = dcos;

		vertices[i].edges.push_back(ei);
		vertices[j].edges.push_back(ej);

		return;
	}

	void setKey(LL i,LL newKey){//キー変更
		vertices[i].key = newKey;
	}

	void setKey(LL i,double newKey){//キー変更
		vertices[i].key = newKey;
	}

	 edge getEdge(LL i,LL j){

		 rep(a,0,vertices[i].edges.size()){
			 if(vertices[i].edges[a].to == j){
				 return vertices[i].edges[a];
			 }
		 }

		 return (edge){j,INF,DINF};//なければ,コストINFの枝を返す
	}

	void bellman_ford(LL s,LL b[]){
		 fill(b,b+V,INF);

		 b[s] = 0;


		 while(true){

			 bool update = false;
			 rep(i,0,V){
				rep(j,0,vertices[i].edges.size()){
					edge e = vertices[i].edges[j];

					if(b[e.to] > b[i] + e.cost){
						b[e.to] = b[i] + e.cost;
						update = true;
					}

				}
			}
			if(!update)
				break;
		 }

		 return;
	}

	void dijkstra(LL s, LL d[]) {//ダイクストラ(始点を入力とし、各点への最小距離を返す)

	    priority_queue<pLL, vector<pLL>, greater<pLL> > que;

	    fill(d,d+V,INF);
	    d[s] = 0;
	    que.push(pLL(0, s));

	    while (!que.empty()) {
	        pLL p = que.top();
	        que.pop();
	        LL v = p.second;
	        if (d[v] < p.first) continue;

	        rep(i,0, vertices[v].edges.size()) {
	            edge e = vertices[v].edges[i];
	            if (d[e.to] > d[v] + e.cost) {
	                d[e.to] = d[v] + e.cost;
	                que.push(pLL(d[e.to], e.to));
	            }
	        }
	    }

	    return;

	}

	void warshall_floyd(LL **w){

		rep(i,0,V){
					rep(j,0,V){
						w[i][j] = INF;
					}
		}
		rep(i,0,V){
			rep(j,0,vertices[i].edges.size()){
				w[i][vertices[i].edges[j].to] = vertices[i].edges[j].cost;
			}
		}

		rep(i,0,V){
				w[i][i] = 0;
		}

		rep(i,0,V){
			rep(j,0,V){
				rep(k,0,V){
					w[i][j] = min(w[i][j],w[i][k]+w[k][j]);
				}
			}
		}

	}



};

class UF
{
public:
	LL N;
	LL* par;
	LL*  rank;

	UF(LL n){
		 N = n;

		 par = new LL[N];
		 rank = new LL[N];

		 rep(i,0,N){
			 par[i] = i;
			 rank[i] = i;
		 }

		 return;

	}

	LL root(LL x){
		if(x == par[x])
			return x;
		else
			return par[x] = root(par[x]);

	}

	bool same(LL x,LL y){
		return (root(x) == root(y));

	}

	void Union(LL x,LL y){
		LL rtx = root(x);
		LL rty = root(y);

		if(rank[rtx] < rank[rty]){
			par[rtx] = rty;
		}
		else{
			par[rty] = rtx;
			if(rank[rtx] == rank[rty]){
				rank[rtx]++;
			}
		}

	}

};

class ST{


};

/*↑マイライブラリ↑*/

LL solveA(){
	LL x[5];


	rep(i,0,5){
		cin >> x[i];
		if(x[i] == 0){
			cout << i+1;
			return 0;
		}
	}

	return 0;
}

LL solveB(){
	LL X,Y;

	cin >> X >> Y;

	if(Y % 2 == 0 && 2*X <= Y && Y <= 4*X){
		cout <<"Yes";
	}else{
		cout << "No";
	}
	return 0;
}

LL solveC(){
	LL X,N;

	cin >> X >> N;

	set<LL> p;

	rep(i,0,N){
		LL x = linp();
		p.insert(x);
	}

	for(LL i = X,j = X;0 <= i && j <= 101;--i,j++){

		if(p.find(i) == p.end()){
			cout << i << endl;
			return 0;
		}
		if(p.find(j) == p.end()){
			cout << j << endl;
			return 0;
		}
	}


 	return 0;
}

LL solveD(){
	LL N = linp();

	LL A[N];

	rep(i,0,N){
		A[i] = linp();
	}

	sort(A,A+N);
//
//	LL count = 0;
//	rep(i,0,N){
//
//		while(i < N - 1 && A[i+1] == A[i]){
//			a.insert(A[i]);
//			i++;
//		}//同じ数字があれば次へ
//
//		count++;
//
//		for(LL j = 1;j*j <= A[i];j++){
//			if(A[i] % j == 0 && (a.find(j) != a.end() ||  a.find(A[i]/j) != a.end())){
//				count--;
//
//				break;
//			}
//		}
//
//		a.insert(A[i]);
//	}
//
//	cout << count;

	bool dp[1000001];
	fill(dp,dp+1000001,true);

	LL count = 0;

	rep(i,0,N){

		while(i < N - 1 && A[i+1] == A[i]){
			dp[A[i]] = dp[A[i+1]] = false;
			i++;
		}//同じ数字があれば次へ

		if(dp[A[i]]){
			count++;
		}


		for(LL j = A[i];j < 1000001;j+= A[i]){
			dp[j] = false;
		}

	}

	cout << count;

	return 0;

}



LL solveE(){
	LL N,Q;

	cin >> N >> Q;

	LL A[N+1],B[N+1];
	LL C[Q+1],D[Q+1];

	map<LL,LL> rate[N];//各幼稚園のレート最大値

	rep(i,1,N+1){
		cin >> A[i] >> B[i];
		rate[i][A[i]]++;
	}

	rep(i,1,Q+1){
		cin >> C[i] >> D[i];
		rate[D[i]][A[C[i]]]++;

		if(--rate[B[C[i]]][A[C[i]]]== 0){
			rate[B[C[i]]].erase(A[C[i]]);
		}
	}

	LL ans = INF;
	rep(i,0,N){
		ans = min(ans,rate[i].begin()->first);
	}

	cout << ans;

	return 0;
}

signed main(){
	//solveA();
	//solveB();
	//solveC();
	solveD();
	//solveE();
	return 0;
}


Measured memory_bytes: 6232