#include <bits/stdc++.h>
using namespace std;
int n, a[110], vis[110];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int ans = 0, flag = 0;
  for (int i = 1; i <= n; i++) {
    bool k = 0;
    if (vis[i]) continue;
    vis[i] = 1;
    for (int j = i + 1; j <= n; j++)
      if (!vis[j] && a[j] % a[i] == 0) {
        vis[j] = 1;
      }
    ans++;
  }
  printf("%d", ans);
  return 0;
}
