#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;

vector< int > A;

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

	int N;
	scanf("%d",&N);

	int i,a1;
	for(i=1; i<=N; ++i)
	{
		scanf("%d",&a1);
		A.push_back(a1);
	}

	//make_heap( A.begin(), A.end() );
	//sort_heap( A.begin(), A.end() );
	sort( A.begin(), A.end() );

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

	return 0;
}