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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(count);
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A[] = new int[N];
        for(int i=0;i<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(count);
    } 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<A.length;i++){
            A[i] = sc.nextInt();
        } int i=0; int i=0; i 0 i<A.length i A.length A A.length 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 count = 0; count 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 tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        } flag {
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        } flag = false flag false for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    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 tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            } {
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            } if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                } A[j] < A[j-1] A[j] A j A[j-1] A j-1 j 1 {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                } int tmp; tmp tmp = A[j-1] tmp 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] = tmp A[j] A j tmp count++ count flag = true flag true for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        } int i = 0; int i = 0; i 0 i < A.length-1 i A.length-1 A.length A A.length 1 i++ i++ i {
            System.out.printf("%d ",A[i]);
        } {
            System.out.printf("%d ",A[i]);
        } System.out.printf("%d ",A[i]) System.out.printf System.out System System.out "%d " 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(count) System.out.println System.out System System.out count 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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(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<A.length;i++){
            A[i] = sc.nextInt();
        }
        int count = 0;
        boolean flag = true;
        while(flag){
            flag = false;
            for(int j = N-1; j > 0; j--){
                if(A[j] < A[j-1]) {
                    int tmp;
                    tmp = A[j-1];
                    A[j-1] = A[j];
                    A[j] = tmp;
                    count++;
                    flag = true;
                }
            }
        }
        for(int i = 0;i < A.length-1;i++){
            System.out.printf("%d ",A[i]);
        }
        System.out.println(A[N-1]);
        System.out.println(count);
    }
}
