#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int v[100000];

void swapp(int x, int y)
{
	int m = v[x];
	v[x] = v[y];
	v[y] = m;
}

int main()
{
	in >> n;
	for (int i = 1; i <= n; i++)
	{
		in >> v[i];
	}

	for (int i = 1; i <= n; i++)
	{
		if (v[i] >= v[i + 1])
		{
			swapp(i,i+1);
			i = 1;
		}
	}
	
	for (int i = 2; i <= n+1; i++)
	{
		swapp(1, 2);
		out << v[i] << ' ';
	}
}