// timp o(n^2) bubble sort pe cazul cel mai defavorabil
#include <fstream>

using namespace std;

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

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];

    do {
        ok = 1; // presupun sirul sortat
        for (i=1;i<n;i++)
            if (v[i] > v[i+1]) {
                swap(v[i], v[i+1]);
                ok = 0;
            }
    } while (ok == 0);

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

    return 0;
}