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).

Constraints

* 1 ≤ n ≤ 100,000
* 1 ≤ the number of a card ≤ 109
* There are no identical card in the input

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.

Examples

Input

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


Output

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


Input

2
S 1
H 1


Output

Stable
S 1
H 1
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.ArrayList;
/**
 * 境界部分には気をつける(そこだけ別で処理するというのもあり)
 * 逆再生することで簡単になることもある
 */
public class Main {
	public int cnt = 0;
	public static final BigDecimal TWO = new BigDecimal(2);
	public static final BigDecimal THREE = new BigDecimal(3);

    public Main() {
    }

    public static void main(String[] args ) {
            Main main = new Main();
            main.exec();
    }

    public void exec() {
        BufferedReader bf = null;
        try{
            bf = new BufferedReader(new InputStreamReader(System.in));
            exec_body(bf);
        } catch (IOException e) {
            e.printStackTrace();
        }
        finally{
            if( bf != null ) {
                try {
                    bf.close();
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
        }
    }

    public void exec_body( BufferedReader bf ) throws IOException {
    		String s = bf.readLine();
    		ArrayList<Card> cardList = new ArrayList<>(Integer.valueOf(s));
    		String line = bf.readLine();
    		while( line != null && line.length() > 0 ) {
    			String[] elements = line.split(" ");
    			Card card = new Card(elements[0],Integer.parseInt(elements[1]));
    			cardList.add(card);
    			line = bf.readLine();
    		}
    		bf.close();

    		body(cardList);
    }

    public class Card {
		String _character = null;
		int _number = 0;

		public Card( String chara, int number ) {
			_character = chara;
			_number = number;
		}
    }

//    public void exec()
//    {
//    		ArrayList<Card> cardList = new ArrayList<>();
//    		cardList.add(new Card("D",3));
//    		cardList.add(new Card("H",2));
//    		cardList.add(new Card("D",1));
//    		cardList.add(new Card("S",3));
//    		cardList.add(new Card("D",2));
//    		cardList.add(new Card("C",1));
//
//    		body(cardList);
//    }

    public void body( ArrayList<Card> cardList ) {
       	Card[] mergeCards = cardList.toArray(new Card[cardList.size()]);
    		mergeSort(mergeCards, 0, mergeCards.length-1);
    		Card[] quickCards = cardList.toArray(new Card[cardList.size()]);
    		quickSort(quickCards, 0, quickCards.length -1);

    		if( isSameAry(mergeCards, quickCards)) {
    			System.out.println("Stable");
    		} else {
    			System.out.println("Not stable");
    		}

    		for( Card quickCard : quickCards ) {
    			System.out.println( quickCard._character + " " + quickCard._number );
    		}
    }

    public static boolean isSameAry( Card[] srcAry, Card[] dstAry ) {
    		if( srcAry.length != dstAry.length ) {
    			return false;
    		}

		for( int ii = 0; ii < srcAry.length; ii++ ) {
			if( srcAry[ii]._number != dstAry[ii]._number ) {
				return false;
			}
			if( srcAry[ii]._character != dstAry[ii]._character ) {
				return false;
			}
		}

		return true;
    }

    public void mergeSort( Card[] cards, int start, int last ) {
    		if( start >= last ) {
    			return;
    		}

    		int middle = ( start + last ) / 2;
    		mergeSort(cards,start,middle);
    		mergeSort(cards,middle+1,last);
    		merge(cards,start,last,middle);
    }

    public void merge( Card[] cards, int start, int last, int middle ) {
    		Card[] leftCards = new Card[middle-start+2];
    		for( int ii = 0; ii < middle-start+1; ii++ ) {
    			leftCards[ii] = cards[ii+start];
    		}
    		leftCards[middle-start+1] = new Card("D",Integer.MAX_VALUE);

    		Card[] rightCards = new Card[last-middle+1];
    		for( int ii = 0; ii < last-middle; ii++ ) {
    			rightCards[ii] = cards[ii+middle+1];
    		}
    		rightCards[last-middle] = new Card("D",Integer.MAX_VALUE);;

    		int leftIndex = 0;
    		int rightIndex = 0;
    		for( int ii = start; ii <= last; ii++ ) {
    			if( leftCards[leftIndex]._number <= rightCards[rightIndex]._number ) {
    				cards[ii] = leftCards[leftIndex];
    				leftIndex++;
    			} else {
    				cards[ii] = rightCards[rightIndex];
    				rightIndex++;
    			}
    		}
    }

    public void quickSort( Card[] cards, int start, int last ) {
    		if ( start < last ) {
    			int index = partition(cards, start, last);
    			quickSort(cards, start, index-1);
    			quickSort(cards, index + 1, last);
    		}
    }

    public int partition( Card[] cards, int start, int last ) {
    		Card lastCard = cards[last];
    		int insertIndex = start -1;
    		for( int ii = start; ii < last; ii++ ) {
    			Card card = cards[ii];
    			if( card._number <= lastCard._number) {
    				insertIndex++;
    				cards[ii] = cards[insertIndex];
    				cards[insertIndex] = card;
    			}
    		}
    		cards[last] = cards[insertIndex+1];
    		cards[insertIndex+1] = lastCard;
    		return insertIndex+1;
    }
}
