
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();
	}
} 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();
		}
		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();
	}
} 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();
	} 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();
		}
		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();
	} 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 int konkansize = 0; konkansize 0 boolean flag = true; 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;
				}
			}
		} 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;
				}
			}
		} flag = false 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;
				}
			} 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 ste = a[j];
					a[j] = a[j-1];
					a[j-1] = ste;  
					konkansize++;
					flag = true;
				}
			} {
				if(a[j] < a[j-1]){
					int ste = a[j];
					a[j] = a[j-1];
					a[j-1] = ste;  
					konkansize++;
					flag = true;
				}
			} if(a[j] < a[j-1]){
					int ste = a[j];
					a[j] = a[j-1];
					a[j-1] = ste;  
					konkansize++;
					flag = true;
				} a[j] < a[j-1] a[j] a j a[j-1] a j-1 j 1 {
					int ste = a[j];
					a[j] = a[j-1];
					a[j-1] = ste;  
					konkansize++;
					flag = true;
				} int ste = a[j]; ste a[j] a j a[j] = a[j-1] a[j] a j a[j-1] a j-1 j 1 a[j-1] = ste a[j-1] a j-1 j 1 ste konkansize++ konkansize flag = true flag true for(int i=0; i<N-1; i++){
			System.out.print(a[i] + " ");
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			System.out.print(a[i] + " ");
		} {
			System.out.print(a[i] + " ");
		} System.out.print(a[i] + " ") System.out.print System.out System System.out a[i] + " " a[i] a i " " System.out.println(a[N-1]) System.out.println System.out System System.out a[N-1] a N-1 N 1 System.out.println(konkansize) System.out.println System.out System System.out konkansize 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();
		}
		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();
	}
} 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();
	}
} 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();
		}
		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();
	}
}