#include <fstream>
#include <iostream>
using namespace std;

int V[500000];

void merge(int *A, int startA, int stopA, int *B, int startB, int stopB)
{
	int i=startA, j=startB, k=0, *C=new int[stopA-startA+stopB-startB+2];
	while (i<=stopA && j<=stopB)
		if (A[i] < B[j])
			C[k++] = A[i++];
		else C[k++] = B[j++];
	
	while (i <= stopA)
		C[k++] = A[i++];
	while (j <= stopB)
		C[k++] = B[j++];
	
	for (i=startA; i<startA+k; ++i)
		A[i] = C[i-startA];
}

void mergeSort(int *V, int inc, int sf)
{
	if (inc == sf) return;
	int m = (inc+sf)>>1;
	mergeSort(V, inc, m);
	mergeSort(V, m+1, sf);
	merge(V, inc, m, V, m+1, sf);
}

int main()
{
	ifstream in("algsort.in");
	ofstream out("algsort.out");
	int n, i;
	in>>n;
	for (i=0; i<n; ++i)
		in>>V[i];
	
	mergeSort(V, 0, n-1);
	
	for (i=0; i<n; ++i)
		out<<V[i]<<" ";
}