#include <fstream>

using namespace std;

const int N = 5e5;

int v[N], aux[N];

void merge_(int v[], int st, int dr)
{
    int m = (st + dr) / 2;
    int i = st, j = m + 1, k = st;
    while (i <= m && j <= dr)
    {
        if (v[i] <= v[j])
        {
            aux[k++] = v[i++];
        }
        else
        {
            aux[k++] = v[j++];
        }
    }
    while (i <= m)
    {
        aux[k++] = v[i++];
    }
    while (j <= dr)
    {
        aux[k++] = v[j++];
    }
    for (int i = st; i <= dr; i++)
    {
        v[i] = aux[i];
    }
}

void merge_sort(int v[], int st, int dr)
{
    if (st == dr)
    {
        return;
    }
    int m = (st + dr) / 2;
    merge_sort(v, st, m);
    merge_sort(v, m + 1, dr);
    merge_(v, st, dr);
}

int main()
{
    ifstream in("algsort.in");
    int n;
    in >> n;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    in.close();
    merge_sort(v, 0, n - 1);
    ofstream out("algsort.out");
    for (int i = 0; i < n; i++)
    {
        out << v[i] << " ";
    }
    out << "\n";
    out.close();
    return 0;
}