//
// Created by lv_shen on 2023/9/2.
//

#include <bits/stdc++.h>

#define endl "\n"
using namespace std;
typedef long long LL;
typedef unsigned long long u64;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;

int a[N];
map<int, int> mp;


void solve () {
	int n;
	cin >> n;
	int ans = 0;
	mp.clear();
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		while (x) {
			if (x - (x & -x) != 0) {
				x -= (x & -x);
			}
			else {
				break;
			}
		}
		mp[x]++;
		ans = max (ans, mp[x]);
	}
	cout << ans << endl;

}

int main () {
	std::ios::sync_with_stdio (false);
	std::cin.tie (nullptr);
	std::cout.tie (nullptr);

	int t;
	cin >> t;
	while (t--)
		solve ();

	return 0;
}