tjut 5299

#include <bits/stdc++.h>
using namespace std;
#define prt(k) cerr<<#k" = "<<k<<endl
typedef unsigned long long ll;
const int N = 20003;
struct P
{
    int x, y, r;
    bool operator<(P b) const
    {
        return x < b.x;
    }
    ll d(P b)
    {
        ll dx = x - b.x, dy = y - b.y;
        return dx*dx + dy*dy;
    }
}p[N];
bool vis[N];
bool cmp(P a, P b)
{
    return a.r > b.r;
}
int n;
inline ll sqr(ll x) { return x*x; }
struct Edge
{
    int v, next;
} e[N<<1] ;
int head[N], mm;
void add(int u, int v)
{
    // printf("%d --> %d\n", u, v);
    e[mm].v = v;
    e[mm].next = head[u];
    head[u] = mm++;
}
int dfs(int u)
{
    int ret=  0;
    for (int i=head[u];~i;i=e[i].next) {
        ret ^= dfs(e[i].v)+1;
    }
    return ret;
}
int main()
{
    int re, ca=1; cin>>re;
    while ( re-- )
    {
        memset(head, -1, sizeof head); mm=  0;
        scanf("%d", &n);
        for (int i=0;i<n;i++)
            scanf("%d%d%d", &p[i].x, &p[i].y, &p[i].r);
        sort(p ,p+n, cmp);
        int rt = n;
        for (int i=n-1;i>0;i--) {
            bool ok = false;
            for (int j=i-1;j>=0;j--) { /// r[j] > r[i]
                ll a = p[i].d(p[j]);
                ll b = sqr(p[j].r - p[i].r);
                if (a < b) {
                    ok = true;
                    add(j, i);
                    break;
                }
            }
            if (!ok) {
                add(rt, i);
            }
        }
        add(rt, 0);
        int ans = dfs(rt);
        puts(ans ? "Alice" : "Bob");
    }
    return 0;
}