import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	}

	private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} import java.util.Scanner; Scanner java.util public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	}

	private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} Main static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	} main {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	} int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] A = inpNum(n); A inpNum(n) inpNum n bubbleSort(A) bubbleSort A String[] args args private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	} bubbleSort {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	} boolean flag = true; flag true int cnt = 0; cnt 0 while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		} flag {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		} flag = false flag false for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			} int j = A.length - 1; int j = A.length - 1; j A.length - 1 A.length A A.length 1 j > 0 j 0 j-- j-- j {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			} {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			} if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				} A[j] < A[j -1] A[j] A j A[j -1] A j -1 j 1 {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				} int tmp; tmp tmp = A[j] tmp A[j] A j A[j] = A[j - 1] A[j] A j A[j - 1] A j - 1 j 1 A[j -1] = tmp A[j -1] A j -1 j 1 tmp cnt++ cnt flag = true flag true for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		} int k = 0; int k = 0; k 0 k < A.length k A.length A A.length k++ k++ k {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		} {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		} System.out.print(A[k]) System.out.print System.out System System.out A[k] A k if(k < A.length -1) {
				System.out.print(" ");
			} k < A.length -1 k A.length -1 A.length A A.length 1 {
				System.out.print(" ");
			} System.out.print(" ") System.out.print System.out System System.out " " System.out.println() System.out.println System.out System System.out System.out.println(cnt) System.out.println System.out System System.out cnt int[] A A private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	} inpNum {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	} int[] nums = new int[n]; nums new int[n] n for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			nums[i] = sc.nextInt();
		} {
			nums[i] = sc.nextInt();
		} nums[i] = sc.nextInt() nums[i] nums i sc.nextInt() sc.nextInt sc return nums; nums int n n public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	}

	private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	}

	private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

} Main
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int n = sc.nextInt();
		int[] A = inpNum(n);

		bubbleSort(A);

	}

	private static void bubbleSort(int[] A) {
		boolean flag = true;
		int cnt = 0;

		while(flag) {
			flag = false;

			for (int j = A.length - 1; j > 0; j-- ) {
				if (A[j] < A[j -1]) {
					int tmp;
					tmp = A[j];
					A[j] = A[j - 1];
					A[j -1] = tmp;
					cnt++;
					flag = true;
				}

			}

		}

		for (int k = 0; k < A.length; k++ ) {
			System.out.print(A[k]);
			if(k < A.length -1) {
				System.out.print(" ");
			}

		}
		System.out.println();
		System.out.println(cnt);

	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

}
