#include <iostream>
#include <set>
#include <vector>

using namespace std;

int main()
{
    int n; cin >> n;
    
    vector <int> niz;
    vector <int> pom;
    
    for(int i = 0; i != n; i++) {
            int a; cin >> a; niz.push_back(a); }
    
    for(int i = 1; i != n; i++) {
           int a = niz[i] - 1;
           
           bool b = true;
           for(int j = 0; j != pom.size(); j++)
                   if(a % pom[j] == 0) { b = false; break; }
           if(b == true)
                pom.push_back(a); }
    
    cout << pom.size() << endl;
    return 0;
}