#include <bits/stdc++.h>   
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;   
using namespace std;  
#define ll int
#define pb push_back                   
#define mp make_pair          
#define nline "\n"                             
#define f first                                            
#define s second                                             
#define pll pair<ll,ll>   
#define all(x) x.begin(),x.end()       
#define vl vector<ll>             
#define vvl vector<vector<ll>>          
#define vvvl vector<vector<vector<ll>>>          
#ifndef ONLINE_JUDGE    
#define debug(x) cerr<<#x<<" "; _print(x); cerr<<nline;  
#else
#define debug(x);      
#endif  
void _print(ll x){cerr<<x;}
void _print(char x){cerr<<x;}     
void _print(string x){cerr<<x;}    
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   
template<class T,class V> void _print(pair<T,V> p) {cerr<<"{"; _print(p.first);cerr<<","; _print(p.second);cerr<<"}";}
template<class T>void _print(vector<T> v) {cerr<<" [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T>void _print(set<T> v) {cerr<<" [ "; for (T i:v){_print(i); cerr<<" ";}cerr<<"]";}
template<class T>void _print(multiset<T> v) {cerr<< " [ "; for (T i:v){_print(i);cerr<<" ";}cerr<<"]";}
template<class T,class V>void _print(map<T, V> v) {cerr<<" [ "; for(auto i:v) {_print(i);cerr<<" ";} cerr<<"]";} 
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<pair<ll,ll>, null_type, less<pair<ll,ll>>, rb_tree_tag, tree_order_statistics_node_update> ordered_pset;
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
const ll MOD=998244353;
const ll MAX=500500;
const ll till=20;
vector<unordered_map<ll,ll>> freq(till);
void solve(){         
    ll n; cin>>n;
    for(ll i=0;i<till;i++){
        freq[i].clear();
    }
    vector<ll> a(n);
    for(auto &it:a){
        cin>>it;
    }
    sort(all(a));  
    reverse(all(a));
    ll ans=0;
    vector<ll> nax(till,0);
    for(auto it:a){
        ll num=0;
        for(ll i=30;i>=0;i--){
            if(it&(1<<i)){
                num+=(1<<i);
            }
            if(i<till){
                nax[i]=max(nax[i],++freq[i][num]);
            }
        }
        for(ll j=0;j<till;j++){
            if((1<<j)<=it){
                ans=max(ans,nax[j]); 
            }
        }
    }
    cout<<ans<<nline;
    return;        
}                                                                     
int main()                                                                                                             
{                
    ios_base::sync_with_stdio(false);                                  
    cin.tie(NULL);                                              
    ll test_cases=1;               
    cin>>test_cases;
    while(test_cases--){
        solve();
    } 
    cout<<fixed<<setprecision(10);
    cerr<<"Time:"<<1000*((double long)clock())/(double long)CLOCKS_PER_SEC<<"ms\n"; 
}