#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> A, B;
int iswin() {
	int mxC = 0, mxA = -1;
	for (int i = 0; i < n; i++) {
		mxC = max(mxC, min(A[i], B[i]));
		if (A[i] < B[i]) mxA = max(mxA, A[i]);
	}
	for (int i = 0; i < n; i++) {
		if (A[i] < B[i] && A[i] == mxC) return 1;
	}
	if (mxC == 0) return 0;
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		if (min(A[i], B[i]) == mxC) cnt++;
	}
	if (cnt > 1) return 0;
	for (int i = 0; i < n; i++) {
		if (A[i] == B[i] && A[i] == mxC) return 1;
	}
	if (mxA == -1) return 0;
	cnt = 0;
	for (int i = 0; i < n; i++) {
		if (min(A[i], B[i]) > mxA) cnt++;
	}
	if (cnt > 1) return 0;
	return 1;
}
int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		A.resize(n), B.resize(n);
		for (auto &i : A) scanf("%d", &i);
		for (auto &i : B) scanf("%d", &i);
		if (iswin()) puts("Alice");
		else puts("Bob");
	}
}