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

void insertion_sort(vector<int>& A)
{
	int N = A.size();
	
	for(int i = 1;i < N;++i)
	{
		int val = A[i];
		int j = i;
		
		while(j >= 1 && A[j] < A[j - 1])
		{
			A[j] = A[j - 1];
			--j;
		}
		A[j] = val;
	}
}

int main()
{
	ifstream in("algsort.in");
	ofstream out("algsort.out");
	
	int N;
	in >> N;
	
	vector<int> v;
	for(int i = 0;i < N;++i)
	{
		int nr;
		in >> nr;
		v.push_back(nr);
	}
	insertion_sort(v);
	
	for(int i = 0;i < N - 1;++i)
	{
		out<<v[i]<<" ";
	}
	out<<v[N - 1];
	out<<"\n";
	
	in.close();
	out.close();
}