#include <bits/stdc++.h>
using namespace std;
const int N = 120, inf = 5e8;
bool mark[110];
int main() {
  vector<int> v;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end());
  int cnt = n;
  int ans = 0;
  while (cnt > 0) {
    int a;
    for (int x = 0; x < n; x++)
      if (!mark[x]) {
        a = v[x];
        break;
      }
    for (int x = 0; x < n; x++)
      if (!mark[x] && v[x] % a == 0) {
        cnt--;
        mark[x] = true;
      }
    ans++;
  }
  cout << ans;
  return 0;
}
