output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 \cdots A_N
attempt: # 同じものが2つ以上含まれていた場合、それらを除外する
  # 最小値で割っていき、割り切れるものを除外する
  # 最小値を除外し、次の最小値で割っていき、割り切れるものを除外する
  # 最小値が最大値の半分より大きくなるところで探索終了
  
  import numpy as np
  
  N = int(input())
  
  x = np.array(np.uint64(input().split()))
  # print(x)
  
  
  def hantei(list_1, length):
      u, counts = np.unique(list_1, return_counts=True)
      print(u)
      # [ 0 10 20 30]
      print(counts)
      # [2 2 1 1]
      print(u[counts == 1])
      # [20 30]
  
  
  def hantei_2(list_1, length):
      list_2, counts = np.unique(list_1, return_counts=True)
      list_3 = list_2[counts == 1]
      print(list_3)
      list_4 = list_3
      count_list = []
      for k in range(N):
          min_1 = np.amin(list_4)
          max_1 = np.amax(list_4)
          if min_1 > max_1 / 2:
              count_1 = np.count_nonzero(list_4)
              print(count_1)
              break
          else:
              list_4 = list_4[list_4 % min_1 != 0]
              print(list_4)
              count_list.append(min_1)
              print(count_list)
      count_2 = len(count_list)
      print(count_2)
      count_3 = count_1 + count_2
      print(count_3)
  
  
  def hantei_3(list_1, length):
      list_2, counts = np.unique(list_1, return_counts=True)
      list_3 = list_2[counts == 1]
      if np.count_nonzero(list_3) == 0:
          return 0
      else:
          # print(list_3)
          list_4 = list_3
          count_list = []
          for k in range(N):
              min_1 = np.amin(list_4)
              max_1 = np.amax(list_4)
              if min_1 > max_1 / 2:
                  count_1 = np.count_nonzero(list_4)
                  # print(count_1)
                  break
              else:
                  list_4 = list_4[list_4 % min_1 != 0]
                  # print(list_4)
                  count_list.append(min_1)
                  # print(count_list)
          count_2 = len(count_list)
          # print(count_2)
          count_3 = count_1 + count_2
          return count_3
  
  
  print(hantei_3(x, N))
  
problem_description: Statement
  
  Given is a number sequence A of length N.
  
  Find the number of integers i \left(1 \leq i \leq N\right) with the following
  property:
  
    * For every integer j \left(1 \leq j \leq N\right) such that i \neq j , A_j does not divide A_i.
samples: [{"input": "5\n    24 11 8 3 16", "output": "3\n    \n\nThe integers with the property are 2, 3, and 4.\n\n* * *"}, {"input": "4\n    5 5 5 5", "output": "0\n    \n\nNote that there can be multiple equal numbers.\n\n* * *"}, {"input": "10\n    33 18 45 28 8 19 89 86 2 4", "output": "5"}]