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 Ruby (judge verdict: Accepted)

def bubbleSort(arr, n)
    flag = 1 
    cnt = 0
    
    while flag == 1
        flag = 0
        j = n - 1
        while j > 0
            if arr[j] < arr[j-1]
                v = arr[j-1]
                arr[j-1] = arr[j]
                arr[j] = v
                flag = 1
                cnt += 1
            end
            j -= 1
        end
    end 
    return arr, cnt
end

n = ARGF.gets.to_i
arr = ARGF.gets.split
arr = arr.map{|i| i.to_i} 
arr, c = bubbleSort(arr,n)

print arr.shift.to_s
arr.each{|i| print " " + i.to_s}
print "\n"
puts c