#include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <list>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
int i, j, k;
int m, n, p;
char a[10010][10010];
int main() {
	int t;
	scanf("%d", &t);
	while (t--){
		int maxx = 0;
		scanf("%d", &n);
		for (i = 0; i < n; i++)	{
			scanf("%s", a[i]);
		}
		for (i = 0; i < n; i++){
			int num = 1;
			for (j = i + 1; j < n; j++){
				if (strcmp(a[i], a[j]) == 0){
					num++;
				}
			}
			maxx = max(maxx, num);

		}
		printf("%d\n", maxx);
	}
	return 0;

}