#include<atcoder/all>
using namespace atcoder;

#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, n)cin >> a[i];

    vector<vector<int>> div(n);
    rep(i, n){
        for(int x = 1; x * x <= a[i]; x++){
            if(a[i] % x != 0)continue;
            if(x*x != a[i])div[i].push_back(a[i]/x);
            div[i].push_back(x);
        }
    }

    int ok = 0, ng = n+1;
    while(ng - ok > 1){
        int mid = (ok + ng) / 2;
        mf_graph<int> G(n+mid+2);
        rep(i, n)G.add_edge(i, n+mid+1, 1);
        rep(i, mid)G.add_edge(n+mid, n+i, 1);
        rep(i, n)for(auto x : div[i]){
            if(x <= mid)G.add_edge(n+x-1, i, 1);
        }
        if(G.flow(n+mid, n+mid+1) == mid)ok = mid;
        else ng = mid;
    }
    
    cout << ok << endl;
}