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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	}

} import java.util.Scanner; Scanner java.util 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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	}

} 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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	} main {
		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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] A = new int[N]; A new int[N] N for (int i=0; i<N; i++) {
			A[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			A[i] = sc.nextInt();
		} {
			A[i] = sc.nextInt();
		} A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc boolean flg = true; flg true int count = 0; count 0 while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		} flg {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		} flg = false flg false for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			} int j=N-1; int j=N-1; j N-1 N 1 j>0 j 0 j-- j-- j {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			} {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			} if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				} A[j]<A[j-1] A[j] A j A[j-1] A j-1 j 1 {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				} int 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 count++ count flg = true flg true for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		} {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		} if (i!=0) {
				System.out.print(" ");
			} i!=0 i 0 {
				System.out.print(" ");
			} System.out.print(" ") System.out.print System.out System System.out " " System.out.print(A[i]) System.out.print System.out System System.out A[i] A i System.out.println() System.out.println System.out System System.out System.out.println(count) System.out.println System.out System System.out count sc.close() sc.close sc String[] args args 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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	}

} 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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	}

} Main
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();
		}

		boolean flg = true;

		int count = 0;
		while (flg) {
			flg = false;
			for (int j=N-1; j>0; j--) {
				if (A[j]<A[j-1]) {
					int tmp = A[j];
					A[j] = A[j-1];
					A[j-1] = tmp;
					count++;
					flg = true;
				}
			}
		}
		for (int i=0; i<N; i++) {
			if (i!=0) {
				System.out.print(" ");
			}
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(count);

		sc.close();
	}

}