#include <iostream>
#include <vector>

using namespace std;

int maximum(vector<int> arr)
{
    int x = arr[0];
    for (int i = 0; i < arr.size(); i++)
    {
        if (x < arr[i])
            x = arr[i];
    }
    return x;
}

vector<int> function(vector<int> arr)
{
    vector<int> massive(maximum(arr));

    for (int i = 0; i < arr.size(); i++)
    {
        massive[arr[i] - 1] += 1;
    }

    vector<int> nums(massive.size());

    nums[0] = arr.size();

    for (int i = 1; i < nums.size(); i++)
    {
        nums[i] = nums[i - 1] - massive[i - 1];
    }
    return nums;
}

int main()
{
    int n;
    cin >> n;
    vector<int> arr;
    vector<int> nums;

    if (n != 0)
    {
        for (int i = 0; i < n; i++)
        {
            int x;
            cin >> x;
            arr.push_back(x);
        }

        nums = function(arr);
        nums = function(nums);

        for (int i = 0; i < nums.size(); i++)
            cout << nums[i] << endl;
    }

    return 0;
}