#include <fstream>
#include <vector>

using namespace std;

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

void insertionSort(vector <int> &Arr) {

	for (int j = 1; j < (int)Arr.size(); ++j) {

		int key = Arr[j];
		int i = j - 1;

		while (i >= 0 and Arr[i] > key) {

			Arr[i + 1] = Arr[i];
			--i;
		}
		Arr[i + 1] = key;
	}
}

int main() {

	int n;
	fin >> n;

	vector <int> Arr(n);
	for (int &itm : Arr)
		fin >> itm;

	insertionSort(Arr);

	for (const int &itm : Arr)
		fout << itm << ' ';
}