import java.util.Scanner;

public class UnstableMountains {

	private static boolean solveFibbonacciHard(int [] sequence, int [] first_five_terms_to_output) {
		/* ------------------- INSERT CODE HERE ---------------------*/







		/* -------------------- END OF INSERTION --------------------*/

		return false;
	}


	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int numCases = sc.nextInt();

		int[] first_five_terms_to_output = new int[5];

		for(int i = 0; i < numCases; i++) 
		{
			int lengthOfSequence = sc.nextInt();

			int [] sequence = new int[lengthOfSequence];

			for(int j = 0; j < lengthOfSequence; j++) {
				sequence[j] = sc.nextInt();
			}

			if(solveFibbonacciHard(sequence, first_five_terms_to_output)) {
				System.out.println("STABLE " + first_five_terms_to_output[0] + " " + first_five_terms_to_output[1] + " " + first_five_terms_to_output[2] + " " + first_five_terms_to_output[3] + " " + first_five_terms_to_output[4]);
			} else {
				System.out.println("UNSTABLE");
			}
		}
	}
}