#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f){
  cout << (f ? "Yes" : "No") << "\n";
  exit(0);
}

// < val の要素数
template <typename T, typename U>
inline int CountLower(const vector<T> &vec, U val) {
  return distance(vec.begin(), lower_bound(vec.begin(), vec.end(), val));
}
// <= val の要素数
template <typename T, typename U>
inline int CountLowerE(const vector<T> &vec, U val) {
  return distance(vec.begin(), upper_bound(vec.begin(), vec.end(), val));
}
// > val の要素数
template <typename T, typename U>
inline int CountUpper(const vector<T> &vec, U val) {
  return distance(upper_bound(vec.begin(), vec.end(), val), vec.end());
}
// >= val の要素数
template <typename T, typename U>
inline int CountUpperE(const vector<T> &vec, U val) {
  return distance(lower_bound(vec.begin(), vec.end(), val), vec.end());
}
// [val1, val2) の要素数
template <typename T, typename U>
inline int CountInRange(const vector<T> &vec, U val1, U val2) {
  return CountLower(vec, val2) - CountLower(vec, val1);
}

// 約数の列挙O(sqrt(n))
vector<ll> divisor(ll n) {
  vector<ll> res;
  for (ll i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res.emplace_back(i);
      if (i * i != n)
        res.emplace_back(n / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}

ll cnt[1000010];

template <typename T>
vector<pair<T, ll>> RLE(const vector<T> &vec) {
  vector<pair<T, ll>> ret;
  int n = vec.size();
  ll cnt = 0;
  for (int i = 0; i < n; i++) {
    cnt++;
    if ((i < n - 1 && vec[i] != vec[i + 1]) || i == n - 1) {
      ret.emplace_back(vec[i], cnt);
      cnt = 0;
    }
  }
  return ret;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  vll a(n);
  rep(i, n){
    cin >> a[i];
  }
  sort(ALL(a));
  ll ans = 0;
  auto b = RLE(a);
  rep(i, SZ(b)){
    if(b[i].second == 1 && cnt[b[i].first] == 0){
      ans++;
    }
    for(ll j = b[i].first; j < 1000010; j += b[i].first){
      cnt[j]++;
    }
  }
  print(ans);
}


Measured memory_bytes: 15712