// Arup Guha
// 7/17/2012
// Solution to BHCSI Contest Problem: Rain

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

public class rain {
	
	public final static double EPSILON = 1e-10;
	
	public static void main(String[] args) throws Exception {
		
		Scanner fin = new Scanner(new File("rain.in"));
		
		int numCases = fin.nextInt();
		
		// Go through each case.
		for (int loop=1; loop<=numCases; loop++) {
			
			int numDays = fin.nextInt();
			
			// Initial values.
			int curRain = 0, curNoRain = 0, bestRain = 0, bestNoRain = 0;
			
			// Go through each day.
			for (int i=0; i<numDays; i++) {
				
				double rain = fin.nextDouble();
				
				// Set up our current streaks.
				if (rain > EPSILON) {
					curRain++;
					curNoRain = 0;
				}
				else {
					curNoRain++;
					curRain = 0;
				}
				
				// Update any best streaks, if necessary.
				if (curRain > bestRain)
					bestRain = curRain;
				if (curNoRain > bestNoRain)
					bestNoRain = curNoRain;
			}
			
			// Output results.
			System.out.println("Data Set #"+loop+":");
			System.out.println("Longest Streak of Rain: "+bestRain+" Day(s)");
			System.out.println("Longest Streak without Rain: "+bestNoRain+" Day(s)");
			System.out.println();
		}
		
		fin.close();
	}
}