// left side, row 3 (0-indexed), inner desk, University of Washington
// (we need scratch paper)
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define forn(i, a, b) for (int i = (a); i < (b); i++)
#define fore(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)((x).size())
using ll = long long;
using ii = pair<int, int>;

void solve() {
    int n;
    cin >> n;
    int arr[n], brr[n];
    for (int i = 0; i < n; ++i) cin >> arr[i];
    for (int i = 0; i < n; ++i) cin >> brr[i];
    int  cnt[3]={0};
    int c0 = 0, pos =-1;
    bool used = false;
    for (int i = 0; i < n; ++i) {
        if (brr[i] == 0 || (brr[i] == 1 && arr[i] == 1)) {
            c0 ^= arr[i];
        }
        if (brr[i] == 2 && arr[i] % 2 == 1) {
            cout << "Bob" << endl;
            return;
        }
        if(arr[i]!=1) cnt[brr[i]] ++;
        if(brr[i]!=0&&arr[i]!=1) pos = i;
    }
    if(cnt[1]+cnt[2]>=2){
        cout<<"Bob"<<endl;
        return ;
    }
    if(c0 == 1 && cnt[1]==1 && cnt[2] == 0 && arr[pos]%2==0){
        cout<<"Alice"<<endl;
        return ;
    }

    if(c0 == 0 && cnt[1]==1 && cnt[2] == 0 && arr[pos]%2==1){
        cout<<"Bob"<<endl;
        return ;
    }

    if((c0 == 0 && (cnt[1]+cnt[2]==1)) || (c0 != 0 && (cnt[1]+cnt[2] == 0))){
        cout<<"Alice"<<endl;
    }else{
        cout<<"Bob"<<endl;
    }
    // if ((c0 == 0 && !used) || (c0 != 0 && used)) {
    //     cout << "Alice" << endl;
    // } else {
    //     cout << "Bob" << endl;
    // }
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

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


}