#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, A, B;
    cin >> N;

    vector<int> cnt(1e5+5);
    for (int i=0; i<N; i++){
        cin >> A;
        if (i == 0) B = A;
        cnt[1]++;
        cnt[A+1]--;
    }

    for (int i=1; i<1e5+5; i++) cnt[i] += cnt[i-1];

    for (int i=1; i<=B; i++) cout << cnt[i] << " ";
    cout << endl;

    return 0;
}