// Arup Guha
// 3/16/2017
// Solution to 2017 UCF HS Contest Problem: Seahorse Shoes

import java.util.*;

public class shoes {
	
	public static int n;
	public static int[] list;
	
	public static void main(String[] args) {
		
		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();
		
		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {
			
			// Get shoe sizes and sort.
			n = stdin.nextInt();
			list = new int[n];
			for (int i=0; i<n; i++) list[i] = stdin.nextInt();
			Arrays.sort(list);
			
			// Output result.
			System.out.println("Litter #"+loop+": "+solve());
		}
	}
	
	public static int solve() {
		
		// To avoid AOOB.
		if (n == 1) return 1;
		
		int[] dp = new int[n];
		dp[0] = 1;
		dp[1] = list[1] - list[0] <= 2 ? 1 : 2;
		
		// Just run a DP.
		for (int i=2; i<n; i++) {
			
			// Here we get shoes for seahorse i and i-1.
			int addLastTwo = list[i] - list[i-1] <= 2 ? 1 + dp[i-2] : 2 + dp[i-2];
			
			// Our answer is either getting a new pair for just seahorse i, OR whatever we can do for the last two.
			dp[i] = Math.min(dp[i-1]+1, addLastTwo);
		} 
			
		// This is our result.
		return dp[n-1];
	}
}