// Arup Guha
// 12/15/2016
// Solution to 2016 Online HS Problem: Stacks on Stacks

import java.util.*;

public class stacks {

	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++) {

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

			// Read in the stacks.
			for (int i=0; i<n; i++) list[i] = stdin.nextInt();

			// We just care about parity with index...answer is this or "opposite".
			int res = 0;
			for (int i=0; i<n; i++)
				if (list[i]%2 == i%2) res++;

			// Output result.
			System.out.println("Row #"+loop+": Jerry needs to add a minimum of "+(Math.min(res,n-res))+" coins");
		}
	}
}