#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define fi first
#define se second
#define pb push_back
#define mem(a,x) memset(a,x,sizeof(a))
#define all(x) x.begin(),x.end()
#define lisan(x) {sort(all(x));x.erase(unique(all(x)),x.end());}
#define SZ(x) ((int)((x).size()))
#define debug(x) cout<<#x<<"="<<x<<"\n";
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef vector<int> VI;
typedef vector<vector<int>> VII;
typedef vector<ll> VL;
typedef vector<vector<ll>> VLL;
typedef unsigned long long ull;
typedef	double db;
template<typename T> inline void cmax(T &a,const T b){if(a<b) a=b;}
template<typename T> inline void cmin(T &a,const T b){if(a>b) a=b;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T> inline T lcm(T a,T b){return a/gcd(a,b)*b;}
constexpr int N=1e6+10;
constexpr int mod=1e9+7;
//constexpr int mod=998244353;
int n,a[N],v[N],num[31],ans;
inline void solve(){
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",&a[i]),v[i]=false;
	ans=0;
	rep(i,0,30) num[i]=0;
	per(i,0,30){
		rep(j,1,n)
			if(!v[j]&&(1ll<<i&a[j])){
				v[i]=true;
				num[i]++;
			}
	}
	rep(i,0,30) cmax(ans,num[i]);
	printf("%d\n",ans);
}
int main(){
	int T=1;
	scanf("%d",&T);
	while(T--) solve();
}