#include<stdio.h>
int main(){
    int n,arr[1000], deleted[1000] = {0};
    // deleted array ta nibo mark kore rakhar jonno kono
    // position e number delete kora hoise ki hoyni eta bojhar jonno

    // input
    scanf("%d", &n);
    for(int i=0; i<n; i++) {
        scanf("%d", &arr[i]);
    }

    // Prothome array ta sort korbo karon shobcheye 
    // choto number gulo theke multiple nite hobe
    for(int i=0; i<n-1; i++) {
        for(int j=i+1; j<n; j++) {
            if(arr[i] > arr[j]) {
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }
    }

    int step_count = 0; // koto step e delete korbo seta count korbo
                        // eitai hobe answer

    // shuru theke number nea start korbo
    for(int i=0; i<n; i++) {
        if(deleted[arr[i]]) continue; // jodi number agei deleted thake
                                      // tahole skip kore next step e jabo

        int base_number = arr[i]; // jei_number ke base dhore
                                  // tar multiple gulo delete korbo
        deleted[base_number] = 1; // Base number nijeo delete jabe

        // base number theke er porer number gulo te check korbo
        // shei number gulo multiple kina
        for(int j=i+1; j<n; j++) {  
            if(arr[j] % base_number == 0) {       // If multiple
                deleted[arr[j]] = 1;               // eta ke deleted 
            }                                     // hishebe count korbo
        }
        // ek step e delete kora hoise tai step count barabo
        step_count++;
    }
    printf("%d", step_count); // output
    return 0;
}