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();
		}
		bubbleSort(A,N);
	}
	public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	}
} 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();
		}
		bubbleSort(A,N);
	}
	public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	}
} 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();
		}
		bubbleSort(A,N);
	} 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();
		}
		bubbleSort(A,N);
	} 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 bubbleSort(A,N) bubbleSort A N String[] args args public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	} bubbleSort {
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	} int flag = 1 flag 1 count=0; count 0 while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		} flag==1 flag 1 {
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		} flag = 0 flag 0 int i=0; i 0 for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			} int j=i; int j=i; j i j<N-1 j N-1 N 1 j++ j++ j {
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			} {
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			} if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				} A[j+1]<A[j] A[j+1] A j+1 j 1 A[j] A j {
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				} int c = A[j+1]; c A[j+1] A j+1 j 1 A[j+1] = A[j] A[j+1] A j+1 j 1 A[j] A j A[j] = c A[j] A j c count++ count flag = 1 flag 1 i++ i for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		} {
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		} System.out.print(A[i]) System.out.print System.out System System.out A[i] A i if(i!=N-1)System.out.print(" "); i!=N-1 i N-1 N 1 System.out.print(" ") System.out.print System.out System System.out " " System.out.printf("\n%d\n",count) System.out.printf System.out System System.out "\n%d\n" count int[] A A int N N 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();
		}
		bubbleSort(A,N);
	}
	public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	}
} 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();
		}
		bubbleSort(A,N);
	}
	public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	}
} 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();
		}
		bubbleSort(A,N);
	}
	public static void bubbleSort(int[] A,int N){
		int flag = 1,count=0;
		while(flag==1){
			flag = 0;
			int i=0;
			for(int j=i;j<N-1;j++){
				if(A[j+1]<A[j]){
					int c = A[j+1];
					A[j+1] = A[j];
					A[j] = c;
					count++;
					flag = 1;
				}
			}
			i++;
		}
		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",count);
	}
}
