#include <bits/stdc++.h>

using namespace std;

void insertion_sort(int A[], int l, int r)
{
    for (int i = l + 1; i <= r; ++i)
    {
        int j = i;

        while (j > l && A[j - 1] > A[j])
        {
            swap(A[j - 1], A[j]);
            j--;
        }
    }
}

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

    insertion_sort(A, 0, N - 1);

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

    return 0;
}