#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include<string.h>
#define DIM 5
 void sort_select(int arr[DIM], int arr_size, int n_cmp, int n_move){
 int i;  int j;
    int c, min1;
    int k;
 for (i=0; i<arr_size; i++){


    min1 = arr[i];
    for (j = i+1;j <arr_size; j++){
        if (arr[j] < min1){
            c = min1;
            k = j;
            min1 = arr[j];
        }
    }
    if (arr[i] > min1 ){
            arr[k] = arr[i];
            arr[i] = min1;
            n_move++;

        }
    n_cmp += arr_size - i - 1;
    }
 for (i = 0; i<arr_size; i++){
    printf("%d\n", arr[i]);
 }
 printf("%d\n", n_cmp);
 printf("%d\n", n_move);
 return 0;
 }
int sort_insert(double arr[DIM], int arr_size, int n_cmp, int n_move){
int i, j;
int c;
for (i = 1; i < arr_size; i++){
    c = arr[i];
    for (j = i-1; j>=0; j--){
        if (c > arr[j])
            break;
        arr[j+1] = arr[j];
        arr[j] = c;
        n_move++;
        n_cmp += i-j-1;
    }
}
 for (i = 0; i<arr_size; i++){
    printf("%d\n", arr[i]);
 }
 //printf("%d\n", n_cmp);
 //printf("%d\n", n_move);
 return 0;
 }

 int main(){
     int arrays[DIM];
     int arr_size, n_cmp, n_move;
     arr_size = DIM;
     n_cmp = 0;
     n_move = 0;
     int i;
     for(i=0; i< arr_size; i++){
     scanf("%d", &arrays[i]);

     }
     sort_insert(arrays, arr_size, n_cmp, n_move);
     return 0;
 }