#include <iostream>
#include <cstdio>
using namespace std;
const int N=1e6+10;
void merge_sort(int q[], int l, int r)
{
if(l>=r)
return;
int mid=l + r>>1;
merge_sort(q, l, mid);
merge_sort(q, mid+1, r);
int k=0, i=l, j=mid+1, t[N];
while(i<=mid&&j<=r)
{
if(q[i]<=q[j])
{
t[k++]=q[i++];
}
else
{
t[k++]=q[j++];
}
}
while(i<=mid)
{
t[k++]=q[i++];
}
while(j<=r)
{
t[k++]=q[j++];
}
for(int i=l, j=0; i<=r; i++, j++)
{
q[i]=t[j];
}
}
int main()
{
int n;
scanf("%d", &n);
int q[N];
for(int i=0; i<n; i++)
{
scanf("%d", &q[i]);
}
merge_sort(q, 0, n-1);
for(int i=0; i<n; i++)
{
printf("%d ", q[i]);
}
return 0;
}