// Bubble Sort - Complexitate O(n^2)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

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

const int dim = 500001;

int v[dim];

int main()
{
    int n, i, aux;

    in >> n;
    for(i = 1; i <= n; i++) {
        in >> v[i];
    }
    aux = n;

    // bubble sort
    bool ok;
    do {
        ok = 1; // presupun ca vectorul este sortat
        
        // caut o neregula
        for(i = 1; i < n; i++) {
            if(v[i] > v[i + 1]) {
                swap(v[i], v[i+1]);
                ok = 0;
            }
        }
        n--;
    } while(ok == 0);

    // afisare vector v
    for (i = 1; i <= aux; i++) {
        out << v[i] << " ";
    }

    return 0;
}