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)

  array_index = gets(chomp:true).to_i
  array = gets(chomp:true).split.map(&:to_i)

  rep_count = 0

  for loop_num in 0...array_index

    rigth_ope_index = array_index - 1
    left_cmp_index = rigth_ope_index - 1

    while left_cmp_index >= loop_num 

      if array[left_cmp_index] > array[rigth_ope_index]

        temp_elem = array[rigth_ope_index]

        array[rigth_ope_index] = array[left_cmp_index]
        array[left_cmp_index] = temp_elem

        rep_count += 1
      end

      left_cmp_index -= 1
      rigth_ope_index -= 1
    end

  end

  puts array.join(" ")
  puts rep_count