#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#define pb push_back
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector<T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 200087;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    vector <int> a(n), matched(n), vis(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    auto dfs = [&](auto self, int v) -> bool {
        vis[v] = 1;
        for (int i = 0; i < n; ++i) if (a[i] % v == 0) {
            if (!matched[i] || (!vis[matched[i]] && self(self, matched[i]))) {
                matched[i] = v;
                return true;
            }
        }
        return false;
    };
    int ans = 1;
    while (dfs(dfs, ans)) {
        vis.assign(n, 0);
        ans++;
    }
    cout << --ans << "\n";
}