#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

long long ca, cb;
int sa[1000010], sb[1000010];
int ia[100010], ib[100010];
int ma = -1, mb = -1;
int n, t;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> t;
    while (t--) {
        ma = mb = -1;
        ca = cb = 0;
        memset(sa, 0, sizeof sa);
        memset(sb, 0, sizeof sb);
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> ia[i];
            ma = max(ma, ia[i]);
        }
        sort(ia + 1, ia + n + 1);
        for (int i = 1; i <= n; i++) sa[ia[i]]++;
        for (int i = 1; i <= n; i++) {
            cin >> ib[i];
            mb = max(mb, ib[i]);
        }
        sort(ib + 1, ib + n + 1);
        for (int i = 1; i <= n; i++) sb[ib[i]]++;
        sa[n + 1] = sb[n + 1] = 0;
        for (int i = 1; i <= max(ma, mb); i++) {
            sa[i] += sa[i - 1];
            sb[i] += sb[i - 1];
        }
        // for (int i = 1; i <= ma; i++) cout << sa[i] << " ";
        // cout << endl;
        // for (int i = 1; i <= mb; i++) cout << sb[i] << " ";
        // cout << endl;
        for (int i = 1; i <= n; i++) {
            ca += (long long)sb[ia[i]];
            // cout << ca << endl;
        }
        for (int i = 1; i <= n; i++) {
            cb += (long long)sa[ib[i]];
            // cout << cb << endl;
        }
        // cout << ca << " " << cb << endl;
        if (ca > cb) cout << "Alice" << endl;
        else if (ca < cb) cout << "Bob" << endl;
        else cout << "Tie" << endl; 
    }
    return 0;
}