#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;

int main()
{
    ll n;
    cin >> n;
    vector<int> a(n);
    string delim = "";
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    for (int i = 1; i <= a[n-1]; i++){
        auto pos = lower_bound(a.begin(), a.end(), i);
        ll idx = distance(a.begin(), pos);
        cout << delim << n- idx;
        delim = " ";
    }
    cout << endl;
}