#include <stdio.h>
#include <algorithm>
using namespace std;
int A[500001];
/*
int pivot(int st,int dr)
{
int x=A[st];
while (st<dr)
{
while (st<dr && x<=A[dr]) dr--;
A[st] = A[dr];
while (st<dr && x>=A[st]) st++;
A[dr] = A[st];
}
A[st] = x;
return st;
}

void sort(int st,int dr)
{
if (st<dr)
{
int m = pivot(st,dr);
sort(st,m-1);
sort(m+1,dr);
}
}
*/

int main()
{
FILE *in = fopen("algsort.in","r");
FILE *out = fopen("algsort.out","w");
int n,i;
fscanf(in,"%d",&n);
for (i=1;i<=n;i++) fscanf(in,"%d",&A[i]);
sort(A,A+n);
for (i=1;i<=n;i++) fprintf(out,"%d ",A[i]);
}