#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n + 1);
  for (int i = 1; i <= n; i++) cin >> a[i];
  vector<long long> b;
  sort(a.begin(), a.end());
  for (int i = 1; i < n; i++)
    if (a[i] != a[i + 1]) b.push_back(a[i]);
  b.push_back(a[n]);
  map<long long, long long> mp;
  mp.clear();
  for (int i = 0; i < b.size(); i++) mp[b[i]]++;
  long long ans = 0;
  for (int i = 0; i < b.size(); i++) {
    if (mp[b[i]] == 0) continue;
    for (int j = 1; j <= 100 / b[i]; j++) {
      mp[b[i] * j] = 0;
    }
    ans++;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(0);
  solve();
}
