#include <fstream>
using namespace std;

const int NMAX = 500000;
int v[1 + NMAX];
int copie[1 + NMAX];

void merge_sort(int st, int dr)
{
    if (st == dr)
    {
        return;
    }

    int mij = (st + dr) / 2;

    merge_sort(st, mij);
    merge_sort(mij + 1, dr);

    int i = st, j = mij + 1;
    int crt = 0;
    while (i <= mij && j <= dr)
    {
        if (v[i] < v[j])
        {
            crt++;
            copie[crt] = v[i];
            i++;
        }
        else
        {
            crt++;
            copie[crt] = v[j];
            j++;
        }
    }
    while (i <= mij)
    {
        crt++;
        copie[crt] = v[i];
        i++;
    }

    while (j <= dr)
    {
        crt++;
        copie[crt] = v[j];
        j++;
    }
    for (int k = 1; k <= crt; k++)
    {
        v[st + k - 1] = copie[k];
    }
}

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

    in >> n;

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

    merge_sort(1, n);

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

    return 0;
}