#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1) 
#define here system("pause")
using namespace std;

const int N = 5e6+5;
const int mod = 998244353;
const int INF = 1e15+7;
const double eps = 1e-6;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}

int n;
inline bool check(vector<int> &a, vector<int> &b){
	vector<int> c(n), op(n);
	int mxc = -1, mxn = -1;
	for(int i=0;i<n;i++){
		c[i] = min(a[i], b[i]);
		mxc = max(mxc, c[i]);
		if(a[i] > b[i]) op[i] = 1;
		else if(a[i] == b[i]) op[i] = 0;
		else op[i] = -1;
		if(op[i]==-1) mxn = max(mxn, c[i]);
	}
	
	for(int i=0;i<n;i++){
		if(c[i]==mxc && op[i]==-1) return true;
	}
	
	int cnt = count(all(c), mxc);
	if(cnt>1) return false; 
	
	for(int i=0;i<n;i++){
		if(c[i]==mxc && op[i]==0) return true;
	}
	
	if(mxn==-1) return false;
	cnt = 0;
	for(int i=0;i<n;i++){
		if(c[i] > mxn) ++cnt;
		if(cnt>1) return false;
	}
	return true;
}

inline void sol(){
	cin >> n;
	vector<int> a(n), b(n);
	for(auto &i:a) cin >> i;
	for(auto &i:b) cin >> i;
	if(check(a, b)) cout << "Alice\n";
	else cout << "Bob\n";
}

signed main(){
	IOS;
	int tc = 1;
	cin >> tc;
	while(tc--){
		sol();
	}
	return 0;
}