//quick sort stl
#include<stdio.h>
#include<stdlib.h>


int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}

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

	int n,vector[500000],i;
	scanf("%d",&n);
	for (i=0; i<n; i++)
		scanf("%d",&vector[i]);

	qsort(vector,n,sizeof(int),compare);

		for (i=0; i<n; i++)
		printf("%d ",vector[i]);
	

	return 0;
}