#include <bits/stdc++.h>
using namespace std;
const long long N = 1e2 + 7;
const long long inf = 1e9;
const long long mod = 1e9 + 7;
int n;
int res;
int a[N];
int used[N];
int get(int x) {
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (!used[i] && a[i] % x == 0) {
      used[i] = 1;
      ans = 1;
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    if (used[i] == 1) {
      continue;
    }
    res += get(a[i]);
  }
  cout << res;
}
