#include<fstream>
using namespace std;

int main()
{
	int n, m = 0, *v, *p, rad, poz_v = 0, poz_p;
	ifstream f("algsort.in");
	f >> n;
	rad = sqrt(n);
	v = new int[n];
	p = new int[m / rad + 1];
	f >> v[0];
	p[0] = v[0];
	for (int i = 1; i < n; i++)
	{
		f >> v[i];
		if (!(i % rad))
		{
			v[poz_v] = INT_MAX;
			p[++m] = v[i];
			poz_v = i;
		}
		else
			if (v[i] < p[m])
			{
				p[m] = v[i];
				poz_v = i;
			}
	}
	f.close();
	v[poz_v] = INT_MAX;
	ofstream g("algsort.out");
	for (int afisari = 0, min = INT_MAX; afisari < n; afisari++, min = INT_MAX)
	{
		for (int i = 0; i <= m; i++)
			if (p[i] < min)
			{
				min = p[i];
				poz_p = i;
			}
		g << min << ' ';
		if (p[poz_p] != INT_MAX)
		{
			min = INT_MAX;
			for (int i = rad * poz_p, j = rad * poz_p + rad; i < j && i < n; i++)
				if (v[i] < min)
				{
					min = v[i];
					poz_v = i;
				}
			v[poz_v] = INT_MAX;
			p[poz_p] = min;
		}
	}
	g.close();
	return 0;
}