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

using System;
using System.Linq;
using System.IO;
using System.Text;
using System.Collections;
using System.Collections.Generic;
 
class Program{
    static void Main(){
        int n = int.Parse(Console.ReadLine());
        Card[] cards1 = new Card[n];
        Card[] cards2 = new Card[n];
        string[] inputs = Console.ReadLine().Split(' ');
        for (int i = 0; i < n; i++)
        {
            cards1[i].suit = inputs[i][0];
            cards1[i].value = int.Parse(inputs[i].Substring(1));
        }
        cards1.CopyTo(cards2, 0);

        BubbleSort(ref cards1, n);
        Print(cards1);
        Console.WriteLine("Stable");
        SelectionSort(ref cards2, n);
        Print(cards2);
        if(IsStable(cards1, cards2)) Console.WriteLine("Stable");
        else Console.WriteLine("Not stable");
    }

    static void BubbleSort(ref Card[] cards, int n){
        for (int i = 0; i < n; i++)
        {
            for (int j = n - 1; j >= i + 1 ; j--)
            {
                if(cards[j].value < cards[j - 1].value) Swap(ref cards, j, j - 1);
            }
        }
    }

    static void SelectionSort(ref Card[] cards, int n){
        for (int i = 0; i < n; i++)
        {
            int minj = i;
            for (int j = i; j < n; j++)
            {
                if(cards[j].value < cards[minj].value) minj = j;
            }
            if(i != minj) Swap(ref cards, i, minj);
        }
    }

    static void Swap(ref Card[] cards, int index1, int index2){
        Card tmp = cards[index1];
        cards[index1] = cards[index2];
        cards[index2] = tmp;
    }

    static bool IsStable(Card[] cards1, Card[] cards2){
        if(cards1.Length != cards2.Length) return false;
        for (int i = 0; i < cards1.Length; i++)
        {
            if(cards1[i] != cards2[i]) return false;
        }
        return true;
    }

    static void Print(Card[] cards){
        for (int i = 0; i < cards.Length; i++)
        {
            if(i != 0) Console.Write(" ");
            Console.Write("{0}{1}", cards[i].suit, cards[i].value);
        }
        Console.WriteLine();
    }
}

public struct Card
{
    public char suit {get; set;}
    public int value {get; set;}

    public static bool operator == (Card card1, Card card2){
        return card1.suit == card2.suit && card1.value == card2.value;
    }
    public static bool operator != (Card card1, Card card2){
        return !(card1 == card2);
    }

    // override object.Equals
    public override bool Equals (object obj)
    {
        //
        // See the full list of guidelines at
        //   http://go.microsoft.com/fwlink/?LinkID=85237
        // and also the guidance for operator== at
        //   http://go.microsoft.com/fwlink/?LinkId=85238
        //
        
        if (obj == null || GetType() != obj.GetType())
        {
            return false;
        }
        
        // TODO: write your implementation of Equals() here
        Card c = (Card)obj;
        return this.suit.Equals(c.suit) && this.value.Equals(c.value);
    }
    
    // override object.GetHashCode
    public override int GetHashCode()
    {
        // TODO: write your implementation of GetHashCode() here
        return this.value ^ this.suit.GetHashCode();
    }
}