#include <fstream>

using namespace std;

const int NMAX = 5e5;
int v[1 + NMAX];
int copie[1 + NMAX];

void mergeSort(int left, int right)
{
    if (left == right)
        return;

    int mid = (left + right) / 2;

    mergeSort(left, mid);
    mergeSort(mid + 1, right);

    int i = left;
    int j = mid + 1;
    int crt = 0;
    while (i <= mid && j <= right)
    {
        if (v[i] < v[j])
        {
            ++crt;
            copie[crt] = v[i];
            ++i;
        }
        else
        {
            ++crt;
            copie[crt] = v[j];
            ++j;
        }
    }

    while (i <= mid)
    {
        ++crt;
        copie[crt] = v[i];
        ++i;
    }
    while (j <= right)
    {
        ++crt;
        copie[crt] = v[j];
        ++j;
    }

    for (int k = 1; k <= crt; ++k)
        v[left + k - 1] = copie[k];
}

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    ios_base::sync_with_stdio(false);

    in.tie(nullptr);
    out.tie(nullptr);

    int n;
    in >> n;

    for (int i = 1; i <= n; i++)
        in >> v[i];

    mergeSort(1, n);

    for (int i = 1; i <= n; i++)
        out << v[i] << ' ';
    out << '\n';

    in.close();
    out.close();

    return 0;
}