
import java.util.Scanner;

public class Main {
	public static void main(String [] args){
		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 konkansize = 0;
		//??????????????????
		boolean flag = true;
		while(flag){
			flag = false;
			for(int j=N-1; j>0; j--){
				if(a[j] < a[j-1]){
					int ste = a[j];
					a[j] = a[j-1];
					a[j-1] = ste;  
					konkansize++;
					flag = true;
				}
			}
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i] + " ");
		}
		System.out.println(a[N-1]);
		System.out.println(konkansize);
		sc.close();
	}
}
/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