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: n = int(input())
  a = sorted(list(map(int, input().split())))
  y = set(a)
  acc = 0
  dp = [True] * (a[-1] + 1)
  for i in range(2, a[-1] + 1):
      if i in y:
          if dp[i] == True:
              acc += 1
          dp[2 * i :: i] = [False] * len(dp[2 * i :: i])
  print(acc)
  
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"}]