CF1721D

amazing

#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;

const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;

#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))

#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))

typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

using ll=long long;

ll tt,n,a[(int)1e5+9],b[(int)1e5+9]; 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>tt;
    f(sb,1,tt){
        cin>>n;
        f(i,1,n)cin>>a[i];
        f(i,1,n)cin>>b[i];
        auto check=[&](ll val){
            vector<ll> x,y;
            f(i,1,n)x.push_back(a[i]&val),y.push_back(~b[i]&val);
            sort(all(x)),sort(all(y));
            return x==y;
        };
        ll ans=0;
        for(int i=29;~i;--i){
            if(check(ans|(1ll<<i))){
                ans|=(1ll<<i);
            }
        }
        cout<<ans<<"\n";
    }
    return 0;
}