1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <unordered_map>
#include <string>
#include <queue>
#include <deque>
#include <set>
#include <cstdlib>
#include <ctime>
#include<chrono>
#include<thread>
#include<iomanip>
#include<fstream>
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second

using namespace std;


int main()
{
    int n;
    cin >> n;
    map<int, int> a;
    vector<int> ans(n + 1);
    for(int i = 0; i < n; i++) {
        int o;
        cin >> o;
        if(a.count(o)) a[o]++;
        else a[o] = 1;
    }
    for(auto it : a) {
        for(int i = 1; i <= n; i++) {
            if(it.second - it.second % i == 0) break;
            else ans[i] += it.second - it.second % i;
        }
    }
    for(int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    return 0;
}