output_description: 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.
input_description: 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.
attempt: n = int(input())
  l = input().split(" ")
  L = l[:]
  for k in range(n - 1):
      for j in range(n - 1, 0, -1):
          if L[j][1:] < L[j - 1][1:]:
              L[j], L[j - 1] = L[j - 1], L[j]
      m = l[k:].index(min(l[k:], key=lambda x: x[1]))
      if m != 0:
          l[k], l[m + k] = l[m + k], l[k]
  print(*L)
  print("Stable")
  print(*l)
  print(["Not s", "S"][l == L] + "table")
  
problem_description: 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).
samples: [{"input": "5\n    H4 C9 S4 D2 C3", "output": "D2 C3 H4 S4 C9\n    Stable\n    D2 C3 S4 H4 C9\n    Not stable"}, {"input": "2\n    S1 H1", "output": "S1 H1\n    Stable\n    S1 H1\n    Stable"}]