Problem:
Stable Sort

Let's arrange a deck of cards. There are totally 36 cards of 4 suits(S, H, C, D) and 9 values (1, 2, ... 9). For example, 'eight of heart' is represented by H8 and 'one of diamonds' is represented by D1.

Your task is to write a program which sorts a given set of cards in ascending order by their values using the Bubble Sort algorithms and the Selection Sort algorithm respectively. These algorithms should be based on the following pseudocode:

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

SelectionSort(C)
1 for i = 0 to C.length-1
2 mini = i
3 for j = i to C.length-1
4 if C[j].value < C[mini].value
5 mini = j
6 swap C[i] and C[mini]

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

For each algorithm, report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).

Input

The first line contains an integer N, the number of cards.

N cards are given in the following line. Each card is represented by two characters. Two consecutive cards are separated by a space character.

Output

In the first line, print the arranged cards provided by the Bubble Sort algorithm. Two consecutive cards should be separated by a space character.

In the second line, print the stability ("Stable" or "Not stable") of this output.

In the third line, print the arranged cards provided by the Selection Sort algorithm. Two consecutive cards should be separated by a space character.

In the fourth line, print the stability ("Stable" or "Not stable") of this output.

Constraints

1 ≤ N ≤ 36

Sample Input 1

5
H4 C9 S4 D2 C3

Sample Output 1

D2 C3 H4 S4 C9
Stable
D2 C3 S4 H4 C9
Not stable

Sample Input 2

2
S1 H1

Sample Output 2

S1 H1
Stable
S1 H1
Stable

Solution in Ruby (judge verdict: Accepted)

def stable?(in_arr, out_arr)
  n = in_arr.size

  0.upto(n - 1) do |i|
    (i + 1).upto(n - 1) do |j|
      next unless eq?(in_arr[i], in_arr[j])

      0.upto(n - 1) do |a|
        (a + 1).upto(n - 1) do |b|
          if in_arr[i] == out_arr[b] && in_arr[j] == out_arr[a]
            # puts "i = #{i}, j = #{j}, a = #{a}, b = #{b}"
            return false
          end
        end
      end
    end
  end

  true
end

def eq?(a, b)
  a = a[-1].to_i
  b = b[-1].to_i

  a == b
end

def compare(a, b)
  a = a[-1].to_i
  b = b[-1].to_i

  a > b
end

def bubble_sort(n, a)
  ret = a.dup
  n.times do |i|
    j = n - 1
    while j > i
      if compare(ret[j - 1], ret[j])
        tmp = ret[j]
        ret[j] = ret[j - 1]
        ret[j - 1] = tmp
      end
      j -= 1
    end
  end
  ret
end

def selection_sort(n, a)
  ret = a.dup
  0.upto(n - 1) do |i|
    minj = i
    i.upto(n - 1) do |j|
      if compare(ret[minj], ret[j])
        minj = j
      end
    end

    if i != minj
      tmp = ret[i]
      ret[i] = ret[minj]
      ret[minj] = tmp
    end
  end
  ret
end

n = gets.chomp.to_i
a = gets.chomp.split

b = bubble_sort(n, a)
puts b.join(' ')
puts stable?(a, b) ? 'Stable' : 'Not stable'

s = selection_sort(n, a)
puts s.join(' ')
puts stable?(a, s) ? 'Stable' : 'Not stable'