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: num = int(input())
  date0 = list(map(int, input().split(" ")))
  date0 = set(date0)
  date0 = sorted(date0)
  if len(date0) == 1:
      print(0)
  else:
      i = 0
      b = 0
      c = 0
      while i < len(date0) - 1:
          for j in range(len(date0) - i - 1):
              if date0[j + i + 1] % date0[i] == 0:
                  date0[j + i + 1] = 0
                  b += 1
                  if date0[i + 1] == date0[i]:
                      c = 1
          if b > 0:
              for k in range(b):
                  date0.remove(0)
              b = 0
              k = 0
          if c == 1:
              del date0[i]
              i -= 1
          i += 1
      print(len(date0))
  
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"}]