#include<stdio.h>
#include<algorithm>
using namespace std;
int a[500005];
void quick(int st,int dr)
{
    if(st>=dr) return;
    int med=(st+dr)/2;
    nth_element(a+st,a+med,a+dr+1);
    quick(st,med-1);
    quick(med+1,dr);
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    int n,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    quick(1,n);
    for(i=1;i<=n;i++)
        printf("%d ",a[i]);
    return 0;
}