#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 111;
int n, ans;
int a[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    if (a[i] == -1) continue;
    int x = a[i];
    ans++;
    for (int j = 0; j < n; j++)
      if (a[j] != -1 && a[j] % x == 0) a[j] = -1;
  }
  printf("%d\n", ans);
  return 0;
}
