#include <bits/stdc++.h>
using namespace std;
int a[110];
int b[110];
int main() {
  int n;
  cin >> n;
  memset(b, 0, sizeof(b));
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (b[i] == 1)
      continue;
    else {
      ans++;
      for (int j = i; j <= n; j++)
        if (a[j] % a[i] == 0) b[j] = 1;
    }
  }
  cout << ans << endl;
}
