#include <fstream>
using namespace std;

int a[500001];

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int main()
{
	int n;
	fin >> n;
	int i;
	for ( i = 0; i < n; i++)
		fin >> a[i];
	int aux;
	int sortat;
	do
	{
		sortat = 1;
		for ( i = 0; i < n-1; i++)
			if ( a[i] > a[i+1])
			{
				aux = a[i];
				a[i] = a[i+1];
				a[i+1] = aux;
				sortat = 0;
			}
	}while(!sortat);
	for ( i = 0; i < n; i++)
		fout << a[i] << ' ';
	fout.close();
	fin.close();
	return 0;
}