#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  int mx = *max_element(all(a));
  int l = 0, r = min(n, mx) + 1;
  constexpr int INF = 1001001001;
  while (r - l > 1) {
    int c = (l + r) / 2;
    int s = 0, t = mx + 1;
    mf_graph<int> g(t + 1);
    for (int i = 1; i <= c; i++) g.add_edge(s, i, 1);
    for (int i = 1; i <= mx; i++) {
      for (int j = i + i; j <= mx; j += i) {
        g.add_edge(i, j, INF);
      }
    }
    for (int x : a) g.add_edge(x, t, 1);
    (g.flow(s, t) == c ? l : r) = c;
  }
  cout << l << '\n';
}