#include<iostream>
const int N = 100010;
int q[N], temp[N];
//归并排序找中间段想将数据分割成有序字段再运用双指针归并
void merge_sort(int q[], int l, int r)
{
if (l >= r)
return;
int mid = l + r >> 1;//相当于(l+r)/2,二进制逻辑右移
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r)
{
if (q[i] <= q[j])
temp[k++] = q[i++];
else
temp[k++] = q[j++];
}
while (i <= mid)
temp[k++] = q[i++];
while (j <= r)
temp[k++] = q[j++];
for (int i = l, j = 0; i <= r; i++, j++)
{
q[i] = temp[j];
}
}
int main()
{
int n;
scanf("%d", &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]);
}