#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
const int nmax=500000;
int aux[nmax + 2];
int n, v[nmax+2];
void interclasare (int v[], int st, int dr) {
    int i, j, k;
    int mid=(st+dr)/2;
    i=k=st;
    j=mid+1;
    while (i<=mid && j<=dr)
    {
        if (v[i] <= v[j])
            aux[k++]=v[i++];
        else
            aux[k++]=v[j++];
    }
    while (i<=mid)
        aux[k++]=v[i++];
    while (j<=dr)
        aux[k++]=v[j++];
    for (k=st; k<=dr; k++)
        v[k]=aux[k];
}
void sortare(int v[], int st, int dr) {
    if (st==dr)
        return;
    int mid=(st+dr)/2;
    sortare(v, st, mid);
    sortare(v, mid+1, dr);
    interclasare(v, st, dr);
}
int main() {
    cin>>n;
    for (int i=1; i<=n; i++)
        cin>>v[i];
    sortare(v, 1, n);
    for (int i=1; i<=n; i++)
        cout<<v[i]<<" ";
        return 0;
}