#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector <long long> brod, dan;

int main () {
         
         scanf ("%d", &n);
         dan.resize (n);
         
         int i, j;
         for (i = 0 ; i < n ; ++i) {
             
             cin >> dan [i];
             --dan [i];
             
             if (i) {
                
                bool vec = false;
                for (j = 0 ; j < brod.size () ; ++j) if (dan [i] % brod [j] == 0) { vec = true; break; }
                if (!vec) brod.push_back (dan [i]);
                
                }
             
             }
         
         printf ("%d\n", brod.size ());
         
         cin.get ();
         cin.get ();
         return 0;
         }