import java.util.Scanner;
public class Main{    
    public static void trace ( int n,int []A){
        for ( int j = 0; j < n; j++){
            if ( j > 0 ) System.out.print(" ");
            System.out.print(A[j]);
        }
            System.out.print("\n");
    }
                             
                            
     public static void main(String[] args){
        int n;
        int[] A;
                    
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        A = new int[n];
        
        for ( int j = 0; j < n; j++ ) A[j] = sc.nextInt();
         //bubble sort
        int k=0;
        int tmp=0;
        boolean flag = true;
        while (flag){
            flag = false;
            for ( int j = n-1;j > 0; j--){
                if ( A[j] < A[j-1] ) {
                    tmp    = A[j-1];
                    A[j-1] = A[j];
                    A[j]   = tmp; 
                    k++;
                    flag = true;
                }
            }
        }
         trace(n,A);
         System.out.println(k);
    }
}
/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