#include <iostream>
using namespace std;
const int N = 1e5 + 5;
int prime[N], cnt, st[N], n, a[N], s[N], tot[N];
void get_prime(int n)
{
    for (int i = 2; i <= n; i++)
    {
        if (!st[i])
            prime[cnt++] = s[i] = i;
        for (int j = 0; prime[j] <= n / i; j++)
        {
            st[i * prime[j]] = true, s[i * prime[j]] = prime[j];
            if (i % prime[j] == 0)
                break;
        }
    }
}
int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    get_prime(N - 1);
    int maxv = 1;
    for (int i = 1; i <= n; i++)
        tot[s[a[i]]]++;
    for (int i = 0; i < N; i++)
        maxv = max(maxv, tot[i]);
    cout << maxv << endl;
}

哪怕早点错我都能再看看，71错也太折磨了