// timp o(n^2) sortare prin comparare
#include <fstream>

using namespace std;

int n, i, j, v[500010];

void swap(int &a, int &b) {
    int aux = a;
    a = b;
    b = aux;
}

int main () {

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

    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];

    for (i=1;i<n;i++)
        for (j=i+1;j<=n;j++)
            if (v[i] > v[j]) {
                swap(v[i], v[j]);
            }

    for (i=1;i<=n;i++)
        fout<<v[i]<<" ";

    return 0;
}