#include<stdio.h>
using namespace std;

void quicksort(int v[],int left,int right)
{
	int i=left,j=right;
	int aux;
	int pivot=v[(left+right)/2];
	while(i<=j){
	while(v[i]<pivot)
		i++;
	while(v[j]>pivot)
		j--;
	if(i<=j)
	{
		aux=v[i];
		v[i]=v[j];
		v[j]=aux;
		i++;
		j--;
	}
}
	if(left<j)
		quicksort(v,left,j);
    if(i<right)
		quicksort(v,i,right);


}
int main()
{
	int v[500000],n;
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&v[i]);
	quicksort(v,1,n);
		for(int i=1;i<=n;i++)
			printf("%d",v[i]);
	return 0;
	
}