// Arup Guha
// 5/2/2014
// Solution to UCF HS Contest Problem: Dueling Progress Bars

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

public class bar {

	final public static int TIE = 0;
	final public static int P1LOSING = 1;
	final public static int P2LOSING = 2;

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

		Scanner fin = new Scanner(new File("bar.in"));

		// Process all cases.
		int numCases = fin.nextInt();
		for (int loop=1; loop<=numCases; loop++) {
			int n = fin.nextInt();
			int[] gabe = new int[n];
			for (int i=0; i<n; i++)
				gabe[i] = fin.nextInt();
			int[] aaron = new int[n];
			for (int i=0; i<n; i++)
				aaron[i] = fin.nextInt();

			System.out.println("Video #"+loop+": "+solve(gabe, aaron));
		}
		fin.close();
	}

	public static int solve(int[] list1, int[] list2) {

		int curStatus = TIE;
		int ans = 0;

		// Go through each segment.
		for (int i=0; i<list1.length; i++) {

			// All equal segments should be ignored.
			if (list1[i] == list2[i]) continue;

			// See if anything flipped.
			if (curStatus == P1LOSING && list1[i] > list2[i]) ans++;
			if (curStatus == P2LOSING && list2[i] > list1[i]) ans++;

			// Update current status.
			if (list1[i] < list2[i]) curStatus = P1LOSING;
			if (list2[i] < list1[i]) curStatus = P2LOSING;
		}

		return ans;
	}
}