#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

bool cmp(int a, int b)
{
  return a > b;
}

int main()
{
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  unordered_map<int, int> num_to_counters;

  for(int i = 0; i < n; i++)
  {
    int x;
    cin >> x;
    num_to_counters[x]++;
  }

  vector<int> counters;
  for(auto num_to_counter : num_to_counters)
  {
    counters.push_back(num_to_counter.second);
  }
  sort(counters.begin(), counters.end(), cmp);


  cout << n << " ";
  //int prev = n;

  for(int i = 2; i <= n; i++)
  {
    int cur = 0;
    for(auto k : counters)
    {
      cur += k / i;
      if(k / i == 0)
      {
        break;
      }
    }
    cout << cur * i << " ";
    //prev = cur;
  }
  cout << endl;

}