#include <bits/stdc++.h>
using namespace std;
int a[105];
bool cmp(int x, int y) { return x < y; }
int main() {
  int n, ans = 0, len;
  while (scanf("%d", &n) == 1) {
    memset(a, 0, sizeof(a));
    len = n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    sort(a + 1, a + n + 1, cmp);
    int i = 1;
    while (n > 0) {
      for (; i <= len; i++) {
        if (a[i] > 0) {
          ans++;
          n--;
          break;
        }
      }
      for (int j = i + 1; j <= len; j++) {
        if (a[j] > 0 && (a[j] % a[i]) == 0) {
          a[j] = -10000;
          n--;
        }
      }
      a[i] = -10000;
    }
    cout << ans << endl;
    ans = 0;
  }
  return 0;
}
