#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
int v[500001];
int divide(int p,int q)
{int st=p,dr=q;
int x=v[st];
while (st<dr) {while (st<dr&&v[dr]>=x) dr--;
               v[st]=v[dr];
               while (st<dr&&v[st]<=x) st++;
               v[dr]=v[st];
               }
v[st]=x;
return st;
}
void qs(int p,int q)
{int m=divide(p,q);
if (m-1>p) qs(p,m-1);
if (m+1<q) qs(m+1,q);
}

void qs1(int p,int q)
{int i,j,x;
i=p;
j=q;
x=v[(p+q)>>1];
do {while (i<q&&v[i]<x) i++;
    while (j>p&&v[j]>x) j--;
    if (i<=j) {swap(v[i],v[j]);
               i++;
               j--;
               }
    }while (i<=j);
if (p<j) qs1(p,j);
if (i<q) qs1(i,q);
}


int main()
{int n,i,j;
fscanf(f,"%d",&n);
for (i=1;i<=n;i++) fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
for (i=1;i<=n;i++) fprintf(g,"%d ",v[i]);
return 0;
}