#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 7;

void solve() {
	int n;
	cin >> n;

	vector<int> as(n), bs(n);
	for (int& a : as) cin >> a;
	for (int& b : bs) cin >> b;

	int y = 0, x = 0;
	for (int i = 0; i < n; ++i) {
		int off = min(as[i], bs[i]);
		if (off > y) swap(off, y);
		if (off > x) swap(off, x);
	}

	int win = 0;
	if (x == 0) {
		// Special case for 1 pile
		for (int i = 0; i < n; ++i) {
			if (0 < as[i] && as[i] <= bs[i]) win = 1;
		}
	}
	for (int i = 0; i < n; ++i) {
		if (bs[i] > as[i] && as[i] >= x) win = 1;
	}
	cout << (win ? "Alice" : "Bob") << endl;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) solve();
}