#include <iostream>
#include <fstream>
#include <utility>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

long n,i;long a[500009], b[500009];


void sort(int ls, int ld){

int j,i,k;

    if(ls<ld){
    int m=(ls+ld)/2;
    sort(ls,m);
    sort (m+1,ld);
    for (i=ls, j=m+1, k=ls; i<=m || j<=ld; )
        if (j > ld || (i <= m && a[i] < a[j]))
            b[k++] = a[i++];
        else
            b[k++] = a[j++];
    for (k = ls; k <= ld; k++) a[k] = b[k];
    }
}

int main()
{long k;
f>>n;
for(i=0;i<n;i++) f>>a[i];
sort(0,n-1);
for(i=0;i<n;i++) g<<a[i]<<" ";
f.close();
g.close();

    return 0;
}