#include <fstream>

using namespace std;

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


int n;
int arr[10000];
int sorted[10000];
int counter = 1;

void read()
{
	in >> n;
	for (int i = 1; i <= n; i++) in >> arr[i];
}

void outit2()
{
	for (int i = 1; i <= n; i++) out << arr[i] << ' ';
	out << '\n';
	out << '\n';
}

void sortit()
{
	int min = arr[1];
	int max = 0;
	int mins = 0;

	for (int i = 1; i <= n; i++) //fac maximul
	{
		if (arr[i] >= max) max = arr[i];
	}

	for (int i = 1; i <= n; i++)
	{
		for (int i = 1; i <= n; i++) //fac minimul
		{
			if (arr[i] <= min) min = arr[i];
			mins = i - 1;
		}
		sorted[counter] = min; // adaug minimul in vectorul sortat
		arr[mins] = max; // pun un maxim in vectorul initial ca sa nu mai iau acelasi minim inca o data
		counter++; //cresc indicele pt vecotrul de sortati
		mins = 0;
		outit2();
	}
}

void outit()
{
	for (int i = 1; i <= n; i++) out << sorted[i] << ' ';
}



int main()
{
	read();
	sortit();
	outit();
}