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: Wrong Answer)

def bubble_sort(array)
  length = array.length
  for i in 0..(length-2)
    (length-1).downto(i+1){|j|
      if array[j][1] < array[j-1][1]
        tmp = ""
        tmp = array[j]
        array[j] = array[j-1]
        array[j-1] = tmp
      end
      }
  end
  return array
end

def selection_sort(array)
  length = array.length
  for i in 0..(length-1)
    min = i
    for j in i..(length-1)
      if array[j][1] < array[min][1]
        min = j
      end
        tmp = ""
        tmp = array[i]
        array[i] = array[min]
        array[min] = tmp
    end
  end
  return array
end

def check_stable(bubblesort_array, selectionsort_array)
  bubblesort_array_suits = []
  b_length = bubblesort_array.length
  for i in 0..b_length
    bubblesort_array_suits.push(bubblesort_array[i])
  end
  selectionsort_array_suits = []
  s_length = selectionsort_array.length
  for i in 0..s_length
    selectionsort_array_suits.push(selectionsort_array[i])
  end
  if bubblesort_array_suits == selectionsort_array_suits
    return "Stable"
  else
    return "Not stable"
  end
end

n = gets.chomp.to_i
input_cards = gets.chomp.split.map(&:to_s)
cards = []
for i in 0..(n-1)
  card = input_cards[i].split("")
  card[1] = card[1].to_i
  cards.push(card)
end
cards2 = cards.dup
bubblesort_array = bubble_sort(cards)
selectionsort_array = selection_sort(cards2)
length = bubblesort_array.length
for i in 0..(length-1)
  print bubblesort_array[i][0]
  print bubblesort_array[i][1]
  print " "
end
print "\n"
puts "Stable"
length = selectionsort_array.length
for i in 0..(length-1)
  print selectionsort_array[i][0]
  print selectionsort_array[i][1]
  print " "
end
puts "\n"
puts check_stable(bubblesort_array, selectionsort_array)