#include <stdio.h>
#include <stdlib.h>

void quisort(int *a,int left,int right){
  int p;
  int L=left, R=right;
  int tmp;
  p= a[(left+right)/2];
  
  while(1){
    while(a[L]<p)L++;
    while(a[R]>p)R--;
    
    if(L>=R){
      break;
    }
    tmp=a[R];
    a[R]=a[L];
    a[L]=tmp;
    L++;
    R--;
  }
  
  if(left<(L-1)){
    quisort(a,left,L-1);
  }
  if(right>(R+1)){
    quisort(a,R+1,right);
  }
}

int main(){
  int i,j,n,flag,result;
  int a[200001];
  
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&a[i]);
  }
  if(n==1){
    result=1;
  } else {
    result=0;
  }
  
  quisort(a,0,n-1);
  
  if(1<n){
    result=0;
    for(i=0;i<n;i++){
      flag=0;
      if(a[i]!=a[i+1]){
        for(j=0;j<i && (a[j]*2)<=a[i];j++){
          if(a[i]%a[j]==0){
            flag=1;
            //printf("%d ",a[i]);
            break;
          }
        }
        
        if(flag==0){
          result++;
        }
      }
    }
  } else {
    result=1;
  }
    
  printf("%d",result);
}