// Original C++ solution (slower):
#include <bits/stdc++.h>

 

using namespace std;

 

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;

#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;

#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}

typedef long long ll;

#define int ll

 

#define vi vector<int>

#define vl vector<ll>

#define vii vector< vector<int> >

#define vll vector< vector<ll> >

#define vs vector<string>

#define pii pair<int,int>

#define pis pair<int,string>

#define psi pair<string,int>

#define pll pair<ll,ll>

template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }

template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }

template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

#define X first

#define Y second

#define rep(i,n) for(int i=0;i<(int)(n);i++)

#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)

#define rrep1(i,n) for(int i=(int)(n);i>0;i--)

#define REP(i,a,b) for(int i=a;i<b;i++)

#define in(x, a, b) (a <= x && x < b)

#define all(c) c.begin(),c.end()

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }

template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }

#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());

const ll inf = 1000000001;

const ll INF = (ll)1e18 + 1;

const long double pi = 3.1415926535897932384626433832795028841971L;

#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;

//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};

vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };

#define fio() cin.tie(0); ios::sync_with_stdio(false);

// const ll MOD = 1000000007;

const ll MOD = 998244353;

// #define mp make_pair

//#define endl '\n'

 

 

signed main() {

    fio();

    int n;

    cin >> n;

    vi num(1000111);

    vi a(n);

    rep (i, n) {

        cin >> a[i];

        num[a[i]]++;

    }

 

    int ans = 0;

    rep (i, n) {

        if (num[a[i]] >= 2) continue;

 

        bool flag = true;

        for (int j = 1; j * j <= a[i]; j++) {

            if (a[i] % j == 0) {

                int x = j;

                int y = a[i] / j;

                int nn = num[x];

                if (x == a[i]) nn--;

                if (nn > 0) {

                    flag = false;

                    break;

                }

                nn = num[y];

                if (y == a[i]) nn--;

                if (nn > 0) {

                    flag = false;

                    break;

                }

            }

        }

        if (flag) {

            ans++;

            // DEBUG(a[i]);

        }

    }

    cout << ans << endl;

}

// Optimized solution to the same problem (faster):
#include <iostream>

#include <stdio.h>

#include <vector>

using namespace std;



int main(){

    int n,tmp;

    cin >> n;

    int count_a[1000001] = {0};

    int a_max = -1;

    vector<int> b;

    int count = 0;

    for(int i = 0;i < n;i++){

        cin >> tmp;

        count_a[tmp]++;

        if(a_max < tmp){

            a_max = tmp;

        }

    }



    if(count_a[1] > 1){

        cout << 0 << endl;

        return 0;

    }

    /*

    for(int i= 1;i <= a_max;i++){

        if(count_a[i] == 1){

            b.push_back(i);

        }

    }

    */



    int blength = b.size();

    bool dp[a_max+1];

    for(int i = 0; i < a_max+1;i++){

        dp[i] = true; 

    }



    for(int i= 1;i <= a_max;i++){

        if(count_a[i] >= 1){

            tmp = i;

            for(int j = tmp +tmp;j <= a_max; j+=tmp){

                dp[j] = false;

            }

        }

    }



    for(int i= 1;i <= a_max;i++){

        if(count_a[i] == 1){

            tmp = i;

            if(dp[tmp]){

                count++;

            }

        }    

    }



    cout << count << endl;

    return 0;

}



/*

5

24 11 8 3 16



4

5 5 5 5



10

33 18 45 28 8 19 89 86 2 4

*/

// Fastest known solution for this problem: