Problem:
Quick Sort

Let's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:

Partition(A, p, r)
1 x = A[r]
2 i = p-1
3 for j = p to r-1
4 do if A[j] <= x
5 then i = i+1
6 exchange A[i] and A[j]
7 exchange A[i+1] and A[r]
8 return i+1

Quicksort(A, p, r)
1 if p < r
2 then q = Partition(A, p, r)
3 run Quicksort(A, p, q-1)
4 run Quicksort(A, q+1, r)

Here, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.

Your program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.

Output

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

In the following lines, print the arranged cards in the same manner of that of the input.

Constraints

1 ≤ n ≤ 100,000

1 ≤ the number of a card ≤ 109

There are no identical card in the input

Sample Input 1

6
D 3
H 2
D 1
S 3
D 2
C 1

Sample Output 1

Not stable
D 1
C 1
D 2
H 2
D 3
S 3

Sample Input 2

2
S 1
H 1

Sample Output 2

Stable
S 1
H 1

Solution in Ruby (judge verdict: Accepted)

n = gets.to_i
a = n.times.map{gets.split}
a.map! {|a| {suit: a[0], value: a[1].to_i} }

b = Marshal.load(Marshal.dump(a))

SENTINEL = 2000000000
$cnt = 0

def merge(a, left, mid, right)
  n1 = mid - left
  n2 = right - mid
  l = []
  r = []

  (0...n1).each do |i|
    l[i] = a[left + i]
  end
  (0...n2).each do |i|
    r[i] = a[mid + i]
  end

  l[n1] = r[n2] = {value: SENTINEL}
  i = j = 0

  (left...right).each do |k|
    if l[i][:value] <= r[j][:value]
      a[k] = l[i]
      i += 1
    else
      a[k] = r[j]
      j += 1
    end
  end
end

def merge_sort(a, left, right)
  if left+1 < right
    mid = (left + right) / 2
    merge_sort(a, left, mid)
    merge_sort(a, mid, right)
    merge(a, left, mid, right)
  end
end

def partition(a, p, r)
  x = a[r]
  i = p - 1

  (p...r).each do |j|
    if a[j][:value] <= x[:value]
      i += 1
      tmp = a[i]
      a[i] = a[j]
      a[j] = tmp
    end
  end

  tmp = a[i + 1]
  a[i + 1] = a[r]
  a[r] = tmp
  return i + 1
end

def quick_sort(a, p, r)
  if p < r
    q = partition(a, p, r)
    quick_sort(a, p, q - 1)
    quick_sort(a, q + 1, r)
  end
end

merge_sort(a, 0, n)
quick_sort(b, 0, n - 1)

puts a == b ? 'Stable' : 'Not stable'
puts b.map {|b| "#{b[:suit]} #{b[:value]}" }