#include<fstream>
using namespace std;
int v[500500],n;
void quicksort(int left, int right) {
	if(left<right) {
		int mij=v[(left+right)>>1],i=left,j=right;
		while(i<=j) {
			while(v[i++]<mij);
			while(v[j--]>mij);
			if(i<=j)
				swap(v[i++],v[j--]);
		}
		if(left<j)
			quicksort(left, j);
		if(i<right)
			quicksort(i, right);
	}
}
int main() {
	int i;
	ifstream in("algsort.in");
	for(i=0,in>>n;i<n;in>>v[i],i++);
	in.close();
	quicksort(0,n-1);
	ofstream out("algsort.out");
	for(i=0;i<n;out<<v[i]<<" ",i++);
	out.close();
	return 0;
}