#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; //const bool debug = false; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int op(int a, int b) { return max(a, b); } int e() { return -1; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; mapmp; rep(i, n) { int a; cin >> a; mp[a]++; } vectorc(1000001); for (auto p : mp) { rep2(i, 1, 1000001) if (0 == p.first%i) c[i] += p.second; } mapmp2; rep2(i, 1, 1000001)mp2[c[i]] = i; vectorans(n + 1, -1); for (auto p : mp2)ans[n - p.first + 1] = p.second; rep(i, n) chmax(ans[i + 1], ans[i]); rep(i, n) cout << ans[i + 1] << endl; return 0; }