#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int sum[maxn],maxx,x,n,vis[maxn],sum1,ans=1;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
sum[x]++;
maxx = max(maxx, x);
}
for (int i = 2; i <= maxx; i++) {
sum1 = 0;
if (!vis[i]) {
for (int j = i; j <= maxx; j += i) {
vis[j] = 1;
sum1 += sum[j];
}
}
ans = max(ans, sum1);
}
printf("%d\n", ans);
}