#include <stdint.h>
#include <limits>
#include <fstream>

using namespace std;

const uint32_t MAX_ELEMENTS = 500010;
uint32_t A[MAX_ELEMENTS];
uint32_t N;

void read()
{
	ifstream in("algsort.in");

	in >> N;

	for (uint32_t i = 1; i <= N; i++)
	{
		in >> A[i];
	}

	in.close();
}

void write()
{
	ofstream out("algsort.out");

	for (uint32_t i = 1; i <= N; i++)
	{
		out << A[i] << " ";
	}

	out.close();
}

void insertionSort(){
	for (uint32_t j = 2; j <= N; j++){
		uint32_t key = A[j];
		uint32_t i = j - 1;
		while (i >= 1 && A[i] > key){
			A[i + 1] = A[i];
			i--;
		}
		A[i] = key;
	}
}

void sort()
{
	insertionSort();
}

int main()
{
	read();
	sort();
	write();
}