#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i = 0, ch = 0, c, m;
  cin >> n;
  vector<int> A;
  int W[100];
  for (i = 0; i < 100; i++) W[i] = 0;
  while (n--) {
    cin >> c;
    A.push_back(c);
  }
  sort(A.begin(), A.end());
  while (A.size() != 0) {
    m = A[0];
    for (i = 1; i < A.size(); i++) {
      if (A[i] % m == 0) {
        A.erase(A.cbegin() + i);
        i--;
      }
    }
    ch++;
    A.erase(A.cbegin());
  }
  cout << ch << endl;
  return 0;
}
