#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

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

int main()
{
    int N; fin >> N;
    vector<int> V(N, 0);
    for (int i = 0; i < N; ++i)
        fin >> V[i];

    for (int i = 0; i < N; ++i)
        for (int j = i + 1; j < N; ++j)
            if (V[i] > V[j])
                swap(V[i], V[j]);

    for (int i = 0; i < N; ++i)
        fout << V[i] << " ";
    fout << "\n";
}