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: import numpy as np
  
  length = int(input())
  As = list(map(int, input().split()))
  
  # 1が1つでもいた場合　または
  # 長さが1　または　すべて同じ数字のみの場合
  # ⇒0確定
  if 1 in As or len(set(As)) == 1:
      print(0)
      exit()
  
  As.sort(reverse=True)
  As = np.array(As)
  
  out = 0
  while len(As) > 0:
      # 末尾(最小値)を取得してリストから削除
      e = As[-1]
      As = np.delete(As, -1)
  
      # 重複がある場合
      if e in As:
          # 割り切れたもののインデックス抽出
          tmp = np.where(As % e == 0)
          tmp_ones = np.ones(len(As), dtype=bool)
          tmp_ones[tmp] = False
          As = As[tmp_ones]
      # 重複がない場合
      else:
          out = out + 1
          # 割り切れたもののインデックス抽出
          tmp = np.where(As % e == 0)
          tmp_ones = np.ones(len(As), dtype=bool)
          tmp_ones[tmp] = False
          As = As[tmp_ones]
  
  print(out)
  
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"}]