Problem:
Bubble Sort

Write a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

BubbleSort(A)
1 for i = 0 to A.length-1
2 for j = A.length-1 downto i+1
3 if A[j] < A[j-1]
4 swap A[j] and A[j-1]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 4 of the pseudocode.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by spaces characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

5
5 3 2 4 1

Sample Output 1

1 2 3 4 5
8

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
9

Solution in JavaScript (judge verdict: Accepted)

function main(input){
    let int = parseInt;
    
    let lines = input.split("\n");
    let length = int(lines[0]);
    let nums = lines[1].split(" ");
    nums= nums.map(item=>int(item));
    let sortedIndex=0;
    let swapCount=0;
    let numsPut = "";
    let swapped = false;
    if(length===1){
        console.log(nums[0]);
        console.log(0);
        return;
    }
    
    do{
        swapped = false;
        
        for(let i=length-1;i>sortedIndex;i--){
            if(nums[i]<nums[i-1]){
                let temp = nums[i];
                nums[i] = nums[i-1];
                nums[i-1] = temp;
                swapped = true;
                swapCount++;
            }
        }
        sortedIndex++;
    }while(swapped);
    for(let i=0;i<length;i++){
        numsPut +=String(nums[i])+" ";
    }
    console.log(numsPut.trim());
    console.log(String(swapCount));



}




main(require("fs").readFileSync("/dev/stdin","utf-8"));