/*
#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 = 2e5 + 10;
const int inf = 0x3f3f3f3f;
int  n, t, h, k, m;
double a, b, x;

int main()
{
	while (scanf("%lf %lf %lf", &a, &b, &x) != EOF) 
	{
		double s1 = a * 1.0 / (1 - x)*1.0*b*1.0 / 100.0;
		int ans = 0;
		double sum;
		int n = 1;
		if (a >= s1)
			printf("1\n");
		else


		
	}


}
*/
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <deque>
#define clr(a,b) memset(a,b,sizeof(a))
#define ll long long

using namespace std;

const int maxn = 1e2 + 10;
int t, n;
string s[maxn];
int before, after;

int main()
{
	cin >> t;
	while (t--)
	{
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			cin >> s[i];
		}
		int maxi = 0;
		for (int i = 0; i < n; i++)
		{
			after = 0;
			for (int j = 0; j < n; j++)
			{
				if (s[i] == s[j])after++;
				maxi = max(maxi, after);
			}
		}
		printf("%d\n", maxi);
	}
}