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 C# (judge verdict: WA: Presentation Error)

using System;
using System.Linq;
using System.Text;

namespace test
{
    class Program
    {
        struct Card
        {
            internal char suit;
            internal int value;
        }


        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());

            Card[] A1 = new Card[n];
            Card[] A2 = new Card[n];

            
            string[] input;
            for(int i = 0; i < n; i++)
            {
                input = Console.ReadLine().Split(' ');
                A1[i].suit = input[0][0];
                A2[i].suit = input[0][0];
                A1[i].value = int.Parse(input[1]);
                A2[i].value = int.Parse(input[1]);
            }

            QuickSort(A1, 0, n - 1);

            A2 = A2.OrderBy(a => a.value).ToArray();

            StringBuilder sb = new StringBuilder();
            sb.AppendLine(IsStabel(A1, A2, n) ? "Stable" : "Not stable");
            foreach (var a in A1)
            {
                sb.AppendLine(a.suit + " " + a.value);
            }
            Console.WriteLine(sb);
        }


        static void QuickSort(Card[] A, int p, int r)
        {
            if (p < r)
            {
                int q = Partition(A, p, r);
                // 前パーテーションを再度クイックソート
                QuickSort(A, p, q - 1);
                // 後ろパーテーションを再度クイックソート
                QuickSort(A, q + 1, r);
            }
            
        }

        static int Partition(Card[] A, int p, int r)
        {
            int x = A[r].value;
            // iが前パーテーションの末尾
            int i = p - 1;

            // jが後ろパーテーションの末尾
            for (int j = p; j < r; j++)
            {
                if (A[j].value <= x)
                {
                    i++;
                    var tmp = A[j];
                    A[j] = A[i];
                    A[i] = tmp;
                }
            }
            var tmp2 = A[i + 1];
            A[i + 1] = A[r];
            A[r] = tmp2;
            // パーテーションで区切られた場所のkeyを返す
            return i + 1;
        }

        static bool IsStabel(Card[] A1, Card[] A2, int n)
        {
            for (int i = 0; i < n; i++)
            {
                if (A1[i].suit == A2[i].suit) return false;
            }
            return true;
        }
    }
}