#include<iostream>
#include<queue>
using namespace std;
long long n,a[5001],i,j,bio[5001],rj;
int main()
{
    cin>>n;
    for (i=0; i<n; i++)
    {
    cin>>a[i];
    a[i]--;
    bio[i]=0;   
        }
    for (i=1; i<n; i++)
    if (bio[i]==0)
    {
         rj++;
         bio[i]=1;
         for (j=i+1; j<n; j++)
                if (a[j]%a[i]==0) bio[j]=1;
    }
    cout<<rj<<endl;
    return 0;
}