/*
          ~Keep It Simple!~
*/
 
#include <stdio.h>
int n,v[500001];


void sort(int left,int right)
{
	int i=left,mid= (left+right)/2,j = right;
	
	do
	{
		while( v[i] < v[mid] ) i++;
		while( v[j] > v[mid] ) j--;

		if(i<=j)
		{
			int aux = v[i];
			v[i] = v[j];
			v[j] = aux;
			i++;j--;
		}
	}while(i<=j);
	
    if( left < j )
		sort ( left, j);
	if( i < right )
		sort ( i, right);
}

int main()
{
    freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);

	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&v[i]);
	sort(1,n);
	for(int i=1;i<=n;i++)
		printf("%d ",v[i]);
}