program main
  implicit none

  integer(8) :: n, i, j, cnt, p
  integer(8), allocatable :: a(:)

  read(*,*) n
  allocate(a(n))
  read(*,*) a

  call heapsort(a)

  if (a(1) /= a(2)) then
     cnt = 1
  else
     cnt = 0
  end if 
    
  do i = 2, n
     p = 0
     do j = 1, i-1
        if(mod(a(i),a(j))==0) then
           p = -1
           exit
        else
           p = 1
        end if

     end do

     if(p == 1) then
        cnt = cnt + 1
     end if

  end do

  write(*,*) cnt

  stop
  
  

  contains
  subroutine heapsort(array)
  implicit none
  integer(8), intent(inout) :: array(:)
  
  integer(8) :: i,k,j,l
  double precision :: t
  
  if(n <= 0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  if(n == 1)return

  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j <= k)
        if(j < k)then
           if(array(j).lt.array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
  enddo

  return
end subroutine heapsort
  
end program main
