//
//  insertion_sort.c
//  
//
//  Created by Bibhas Ghoshal on 18/04/23.
//

#include <stdio.h>

void InsertionSort (int A[ ], int size) {
    int i,j, item;
    for (i=1; i<size; i++) {
        printf("i = %d:: ",i);
        for (j=0;j<size;j++) printf("%d, ",A[j]);
        printf("\n"); item = A[i] ;
        for (j=i-1; j>=0; j--)
            if (item > A[j])
            { A[j+1] = A[j]; A[j] = item ; }
            else break;
    } }

int main() {
    int X[100], i, size;
    scanf("%d",&size);
    for (i=0;i<size;i++) scanf("%d",&X[i]);
    InsertionSort(X,size);
    printf("Result = ");
    for (i=0;i<size;i++) printf("%d",X[i]);
    printf("\n"); return 0;
}