import java.util.Scanner;

public class Main{
    public static void main(String[]argc){
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] A = new int[N];
        for(int i=0;i<N;i++){
            A[i] = sc.nextInt();
        }
        int count=0;
        for(int s=0;s<N-1;s++){
            for(int j=N-1;j>s;j--){
                if(A[j]<A[j-1]){
                    int x = A[j];
                    A[j]=A[j-1];
                    A[j-1]=x;
                    count++;
                }
            }
        }
        for(int k=0;k<N;k++){
            if(k==N-1){
                System.out.printf("%d",A[k]);
            }else{
                System.out.printf("%d ",A[k]);
            }
        }
        System.out.printf("\n");
        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