ankita.cpp

/*
*** Question ***
Size of the smallest subset with maximum Bitwise XOR in a 2-D matrix & return the smallest subset.
*/

#include <bits/stdc++.h>

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define f(i,a,b) for(i=a;i<b;i++)
#define fi(i,a,b,x) for(i=a;i<b;i=i+x)
#define fe(i,a,b) for(i=a;i<=b;i++)
#define fr(i,a,b) for(i=a;i>=b;i--)
#define endl '\n'
#define sp '\t'
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define mod 1000000007

using namespace std;

template <typename T>
void print(vector<T>& a, char sep = ' ')
{
    for(auto i : a) { cout<<i<<sep; }
}

ll mod_opr(ll num)
{
    return (num + mod) % mod;
}

template <typename T>
bool compare(T x, T y)
{
    return x > y ? true : false;
}

int main()
{
    fast;
    
    ll tc;
    cin>>tc;
    while(tc--){

        ll n, outputSize = 1;
        cin>>n;
        // vector<vector <ll> > arr(n, vector<ll> (n));  // Considering NxN Vector
        vector<ll> temp(n*n);                            // NxN Elements
        /*
        for(auto& i : arr){
            for(auto& j : i){
                cin>>j;
            }
        }
        */
       for(auto& i : temp){
           cin>>i;
        }
        sort(temp.begin(), temp.end(), greater<ll>());
        ll i, maxXOR = temp[0];
        f(i, 1, 2*n){
            if((maxXOR ^ temp[i]) > maxXOR)
            {
                maxXOR ^= temp[i];
                outputSize++;
            }
        }
        cout<<outputSize<<endl;
    }

    return 0;
}