#include <bits/stdc++.h>

using namespace std;

void bubble_sort(int A[], int l, int r)
{
    bool change;

    do
    {
        change = false;

        for (int i = l; i < r; ++i)
            if (A[i] > A[i + 1])
            {
                swap(A[i], A[i + 1]);
                change = true;
            }

    } while (change == true);
}

const int MAX_N = 500000 + 1;

int A[MAX_N];
int N;

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");

    in >> N;

    for (int i = 0; i < N; ++i)
        in >> A[i];

    bubble_sort(A, 0, N - 1);

    for (int i = 0; i < N; ++i)
        out << A[i] << " ";

    return 0;
}