// countsort o(n) dar pentru numere naturale ce pot fi indici intr-un vector
#include <fstream>

using namespace std;

int n, i, v[1800], x;

int main () {

    ifstream fin ("algsort.in");
    ofstream fout("algsort.out");

    fin>>n;
    // numaram de cate ori apare fiecare valoare
    for (i=1;i<=n;i++) {
        fin>>x;
        v[x] ++;
    }

    for (i=0;i<1800;i++)
        while (v[i] != 0) {
            fout<<i<<" ";
            v[i]--;
        }


    return 0;
}