// Arup Guha
// 9/11/2013
// Solution to 2012 UCF HS Contest Problem: Batarang

import java.util.*;
import java.io.*;

public class batarang {

	public static void main(String[] args) throws Exception {

		Scanner stdin = new Scanner(new File("batarang.in"));
		int numCases = stdin.nextInt();

		// Go through each case.
		for (int loop=1; loop<=numCases; loop++) {

			int n = stdin.nextInt();
			double[] angles = new double[n];

			// Read in coordinates and store reference angles.
			for (int i=0; i<n; i++) {
				int x = stdin.nextInt();
				int y = stdin.nextInt();
				angles[i] = Math.atan2(y,x);
			}

			// Sort...
			Arrays.sort(angles);

			// Just find the # of unique numbers in the list, watching out for flaoting point error.
			int ans = 1;
			for (int i=1; i<n; i++)
				if (angles[i]-angles[i-1] > 1e-9)
					ans++;

			// Output result.
			if (ans == 1)
				System.out.println("Room #"+loop+": Leaping lizards, "+n+" birds with one stone!");
			else
				System.out.println("Room #"+loop+": Batman will only need "+ans+" batarangs!");
			System.out.println();
		}

		stdin.close();
	}
}