#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> a(n), b(n);
    int xorsum = 0;
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
        xorsum ^= a[i];
    }
    int cnt[3] {};
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
        if (a[i] == 1 && b[i] == 1) {
            b[i] = 0;
        }
        cnt[b[i]]++;
    }
    if (xorsum == 0 || cnt[1] + cnt[2] > 1 || (cnt[1] > 0 && xorsum % 2 == 0)) {
        std::cout << "Bob\n";
        return;
    }
    for (int i = 0; i < n; i++) {
        if (a[i] % 2 == 1 && b[i] == 2) {
            std::cout << "Bob\n";
            return;
        }
    }
    if (cnt[1] == 0 && cnt[2] == 0) {
        std::cout << "Alice\n";
        return;
    }
    for (int i = 0; i < n; i++) {
        if (b[i] == 1) {
            if ((xorsum ^ a[i] ^ ((a[i] + 1) % 2)) == 0) {
                std::cout << "Alice\n";
                return;
            }
        }
        if (b[i] == 2) {
            if ((xorsum ^ a[i]) == 0) {
                std::cout << "Alice\n";
                return;
            }
        }
    }
    std::cout << "Bob\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}