#include<stdio.h>
#include<algorithm>
#include<vector>

using namespace std;

FILE *in,*out;

//variabile
int n,x;
vector<int> vect;

int main(void)
{
	in=fopen("algsort.in","rt");
	out=fopen("algsort.out","wt");
	
	fscanf(in,"%d",&n);
	for(int i=1; i<=n; ++i)
	{	
		fscanf(in,"%d",&x);
		vect.push_back(x);
	}	
	
	sort(vect.begin(),vect.end());
	
	vector<int> :: iterator it,end=vect.end();
	
	for(it=vect.begin(); it!=end; ++it)
		fprintf(out,"%d ",*it);	
	
	fclose(in);
	fclose(out);
	return 0;
}