#include <fstream>
#include <algorithm>

using namespace std;

int a[500001];
int c[750000];
int b[750000];
int n;

void insertion(int l, int r){
    int i, j, v;
    for(i = l + 1; i <= r; i++){
        v = a[i];
        j = i - 1;
        while(j >= l && a[j] > v) {a[j+1] = a[j]; j--;}
        a[j+1] = v;
    }

}

int Partition(int l, int r)
{

    	int x = a[(l+r)>>1], aux;
	int i = l, j = r;
	while(i <= j){
        while(a[i] < x) i++;
        while(a[j] > x) j--;
        if(i <= j) { aux = a[i]; a[i] = a[j]; a[j] = aux; i++; j--; }
	}

	return j;
}

int count(){
    int i, j;
    for(i = 0; i < n; i++)
        c[a[i]]++;
    for(i = 1; i < n; i++){
        b[i] = c[i];
        c[i] += c[i-1];
    }
    for(i = n-1; i >= 0; ){
        while(c[a[i]] != i){
            j = a[i];
            swap(a[i], a[c[a[i]]]);
            c[j]--;
        }
        while(i >= 0 && c[a[i]] < (a[i] ? b[a[i]] : 0)) i--;
    }
}


void quick(int l, int r){

    if(r - l > 0){

        int q = Partition(l, r);
        quick(l, q);
        quick(q+1, r);
    }
    //else insertion(l, r);
}

int main(){
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int i = 0;
    f>>n;
    for(i = 0; i < n; i++)
        f>>a[i];
    count();
    for(i = 0; i < n; i++)
        g<<a[i]<<" ";
    return 0;
}