# include<iostream>
using namespace std;
const int N = 1e5 + 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 i = l, j = mid + 1, k = 0;
int temp[N];//另外开一个数组
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=0,j=l;j<=r;j++,i++)
{
q[j] = temp[i];
}
}
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;
}