import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		int n, i, j, num[], count = 0;
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		num = new int[n];
		for (i = 0; i < n; ++i) {
			num[i] = sc.nextInt();
		}
		sc.close();
		i = 1;
		while (i != 0) {
			i = 0;
			for (j = n - 1; j > 0; --j) {
				if (num[j - 1] > num[j]) {
					int tmp = num[j];
					num[j] = num[j - 1];
					num[j - 1] = tmp;
					i = 1;
					++count;
				}
			}
		}
		for (i = 0; i < n; ++i) {
			System.out.print(num[i]);
			if (i != n - 1) {
				System.out.print(" ");
			}
		}
		System.out.print("\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