
import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int bigger ;
        int a[] = new int[N];
        int i,j,k,x ;
        int count =0;
        for (x =0 ; x < N ; x++){
            a[x] = sc.nextInt();
        }
        for (i = 0; a.length > i;i++ ){
            for(j=N-1;j>=i+1;j--){
                if(a[j] <a[j-1]){
                    bigger = a[j-1];
                    a[j-1] = a[j];
                    a[j] = bigger;
                    count++;
                }
            }
        }
        for(k=0; k<N-1;k++){
            System.out.print(a[k]+ " ");
        }
        if(k == N-1){
            System.out.println(a[k]);
        }
        System.out.println(count);
    }

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz