/*
	Bubble Sort Algorithm(Basic)
	@Author: md.moniruzzaman
*/
#include<stdio.h>
#define maxn 100

int array[maxn];

void BSort(int n) {
	int i, j, temp;
	for(i = 0; i<n; i++) {
		for( j = 0; j<n-1; j++) {
			if(array[j] > array[j+1]) {
				temp = array[j];
				array[j] = array[j+1];
				array[j+1] = temp;
			}
		}
	}
}

void Print(int n) {
	int i;
	for(i = 0; i<n; i++) {
		printf(" %d",array[i]);
	}
}

void main() {
	int totalNum, i;
	scanf("%d",&totalNum);
	for(i = 0; i<totalNum; i++) {
		scanf("%d",&array[i]);
	}
	printf("Before Sort:");
	Print(totalNum);
	printf("\n");

	BSort(totalNum);
	printf("After Sort:");
	Print(totalNum);
	puts("");
}