#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int n;
int a[110];
vector<int> v;
int ans;
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < int(n); i++) {
    int x;
    cin >> x;
    a[i] = x;
  }
  sort(a, a + n);
  for (int i = 0; i < int(n); i++) {
    if (v.empty()) {
      ans++;
      v.push_back(a[i]);
      continue;
    }
    bool cancol = 0;
    for (int j = 0; j < int(v.size()); j++) {
      if (a[i] % v[j] == 0) cancol = 1;
    }
    if (!cancol) {
      ans++;
      v.push_back(a[i]);
    }
  }
  cout << ans << endl;
}
