#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<iostream>
#define ll long long 
using namespace std;
const int maxn = 110;
const int inf = 0x3f3f3f3f;
int  n, m, k, N, t;
string s[maxn];
int main()
{
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; ++i) 
		{
			cin >> s[i];
		}
		int ans = 1;
		for (int i = 1; i <= n; ++i) 
		{
			m = 1;
			for (int j = 1; j <= n; ++j) 
			{
				if (i == j)
					continue;
				if (s[i] == s[j])
					m++;
			}
			ans = max(ans, m);
		}
		printf("%d\n", ans);
	}

}