#include <bits/stdc++.h>
const int N = 110;
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') {
      f = -1;
    }
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, a[N], cnt;
int minn[N];
bool in_q(int x) {
  for (int i = 1; i <= cnt; i++) {
    if (x % minn[i] == 0) {
      return 1;
    }
    if (minn[i] % x == 0) {
      minn[i] = x;
      return 1;
    }
  }
  return 0;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (!in_q(a[i])) {
      minn[++cnt] = a[i];
    }
  }
  cout << cnt << endl;
  return 0;
}
