#include <bits/stdc++.h>
using namespace std;


ifstream fin("algsort.in");
ofstream fout("algsort.out");
int a[500001], b[500001], n;

void Citire()
{
    fin >> n;
    for(int i = 1;i <= n;i++)
        fin >> a[i];
}

void Intercls(int st, int m, int dr)
{
    int i, j, l;
    i = l = st; j = m + 1;
    while(i <= m && j <= dr)
    {
        if(a[i] < a[j]) b[l++] = a[i++];
        else b[l++] = a[j++];
    }
    while(i <= m) b[l++] = a[i++];
    while(j <= dr) b[l++] = a[j++];
    for(int i = st;i <= dr;i++) a[i] = b[i];
}

void MergeSort(int st, int dr)
{
    if(st < dr)
    {
        int m = (st + dr) / 2;
        MergeSort(st, m);
        MergeSort(m + 1, dr);
        Intercls(st, m, dr);
    }
}

void Afisare()
{
    for(int i = 1;i <= n;i++)
        fout<<a[i]<<" ";
}

int main()
{
    Citire();
    MergeSort(1, n);
    Afisare();
    return 0;
}