import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for(int tc=1; tc<=T; tc++) {
			int N = sc.nextInt();
			int[] arr = new int[N];
			boolean[] check = new boolean[N];
			int cnt = 0;
			
			for(int i=0; i<N; i++) {
				arr[i] = sc.nextInt();
			}
			
			int num =0;
			for(int i=1; i<N; i++) {
				if(!check[i]) {
					num = arr[i]-arr[0];	//배가 들어오는 주기
					int before = arr[i];
					
					for(int j=i+1; j<N; j++) {
						if(arr[j]==before+num) {
							check[j] = true;
							before = arr[j];
						}
					}
					cnt++;
				}
			}
			System.out.println("#"+tc+" "+cnt);
		}
	}
}