#include <fstream>

using namespace std;

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

int main()
{
	int a[100];
	int n;
	fin >> n;
	int i, j, aux;
	for ( i = 0; i < n; i++ )
		fin >> a[i];
	
	for ( i = 0; i < n; i++ )
		fout << a[i] << ' ';
	fout << '\n';
	
	// Sortare
	for ( i = 0; i < n - 1; i ++ )
		for ( j = i + 1; j < n; j++ )
			if ( a[i] > a[j] )
			{
				aux = a[i];
				a[i] = a[j];
				a[j] = aux;
			}
	
	for ( i = 0; i < n; i++ )
		fout << a[i] << ' ';
	fout << '\n';

	fin.close();
	fout.close();
	return 0;
}