#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define iter(x) for(auto&it:x){cout<<it<<" ";}
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define sz(arr) arr.size()
#define all(arr) arr.begin(),arr.end()
#define sortall(arr) sort(all(arr))
#define sortdes(arr) sort(all(arr),greater<int>())
#define max_ele(x) *max_element(x.begin(),x.end())
#define min_ele(x) *min_element(x.begin(),x.end())
#define nl "\n"
#define cntstbits(n) __builtin_popcount(n);

#ifndef  Rahul100
#define debug(x)cerr<<#x<<" = "; print(x);cerr<<endl;
#else
#define debug(x)
#endif

/* Type def of data types and data structures */
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef vector<int>vii;
typedef vector<ll>vll;
typedef pair<int , int>pii;
typedef pair<ll, ll>pll;

void print(int x) {cerr << x;}
void print(ll x) {cerr << x;}
void print(lld x) {cerr << x;}
void print(string x) {cerr << x;}
void print(double x) {cerr << x;}
void print(ull x) {cerr << x;}
void print(char x) {cerr << x;}
void google(int t) {cout << "Case #" << t << ": ";}

template <class T>void print(vector <T>vec);
template <class T>void print(set <T>vec);
template<class T>void print(unordered_set<T>st);
template <class T, class V>void print(map <T, V>vec);
template <class T, class V>void print(pair <T, V>vec);
template<class T> void print(vector <T>vec) {cerr << "["; for (T i : vec) {print(i); cerr << " ";} cerr << "]";}
template<class T> void print(set <T>vec) {cerr << "["; for (T i : vec) {print(i); cerr << " ";} cerr << "]";}
template<class T> void print(unordered_set <T>vec) {cerr << "["; for (T i : vec) {print(i); cerr << " ";} cerr << "]";}

/* ------------------------------------------*/
vector<ll>sieve(int n);
ll _gcd(ll a, ll b) {if (b == 0)return a; _gcd(b, a % b);}
void precision(lld a) {cout << setprecision(15) << fixed << a; cout << nl;}
void Birep(ll n) {for (int j = 31; j >= 0; j--) {cout << bool((n & (1 << j)));} cout << nl;}
bool isPrime(int n) {for (int i = 2; i * i <= n; i++) {if (n % i == 0)return true;} return false;}
/*---------------------------Main Function----------------------------------------*/

void solve() {

    int n;
    cin >> n;
    int vec[n];

    int minEle = INT_MAX;
    for (int i = 0; i < n; i++) {

        cin >> vec[i];
    }

    minEle = *min_element(vec, vec + n);

    if (vec[0] == minEle) {
        cout << "Bob" << endl;
    }
    else
        cout << "Alice" << endl;
}
int main() {
#ifndef Rahul100
    freopen("debugf.in", "w", stderr);
#endif
    fastio();
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
/*---------------------------Function Decalartions------------------*/
vector<ll>sieve(int n) {
    int *arr = new int [n + 1]();
    vll prime;
    for (int i = 2; i <= n; i++) {
        if (!arr[i]) {
            prime.pb(i);
            for (int j = 2 * i; j <= n; j +=  i)
                arr[j] = 1;
        }
    }
    delete(arr);
    return prime;
}