// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std;
// dfmt on

void main()
{
    long N = lread();
    auto A = aryread();
    A.sort();
    auto sieve = new bool[](10 ^^ 6 + 100);
    long ans;
    // writeln(A);
    foreach (i; 0 .. N)
    {
        bool a = (i - 1 < 0) ? true : A[i - 1] != A[i];
        bool b = (N <= i + 1) ? true : A[i + 1] != A[i];
        if (!sieve[A[i]] && a && b)
        {
            // writeln(sieve[A[i]]);
            // writeln(A[i]);
            ans++;
        }
        foreach (x; 1 .. 10_000_000)
        {
            if (sieve.length <= A[i] * x)
                break;
            sieve[A[i] * x] = true;
        }
    }
    writeln(ans);
}
