// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") // #pragma GCC optimize ("-ffloat-store") // #pragma GCC optimize("Ofast") // #pragma GCC optimize ("unroll-loops") #include "bits/stdc++.h" using namespace std; // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // order_of_key() ; *( find_by_order() ) -> kth element in set; // using namespace __gnu_pbds; // order_of_key(k) -> Number of elements strictly smaller than k // template <typename T> // using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // unsigned seed = chrono::system_clock::now().time_since_epoch().count(); // mt19937 ran(seed); // ran() generates a random number #define ll long long int // #define ll int #define endl '\n' #define vll vector<ll> #define vvl vector<vll> #define pll pair<ll,ll> #define ppl pair<pll,ll> #define vpll vector<pll> #define pb push_back #define mapll map<ll,ll> #define fir first #define sec second #define _cin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define fo(i,b) for(int i=0;i<b;++i) #define repa(i,a,b) for(int i=a;i<b;++i) #define repb(i,a,b) for(int i=a;i>=b;--i) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(v) (ll)((v).size()) #define inf 2000000000000000010 #define mod 1000000007 #define mod1 998244353 /*---------------------DEBUG START---------------------*/ #ifdef NPRAKHAR clock_t start = clock(); void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto it = x.begin();it != x.end();++it) cerr << (f++ ? "," : ""), __print(*it); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #define debug(x...) cerr << __func__<<":"<<__LINE__<< "\n[" << #x << "] = ["; _print(x) #define Time cerr << "Time : " << 1000 * ((double)clock()-start) / (double)CLOCKS_PER_SEC << "ms\n" #else #define debug(x...) #define Time #endif /*---------------------DEBUG END---------------------*/ ll gcd(ll a, ll b, ll &x, ll &y) { if(b==0){x=1;y=0;return a;} ll x1, y1, d = gcd(b,a%b,x1,y1); x=y1; y=x1-(a/b)*y1; return d;} ll power(ll a, ll n) {ll p = 1;while (n > 0) {if(n%2) {p = p * a;} n >>= 1; a *= a;} return p;} ll powm(ll a, ll n, ll mod_){ ll p=1; while(n){ if(n%2){ p=(p*1LL*a)%mod_;} n>>=1; a=(a*1LL*a)%mod_;} return p%mod_;} ll inv(ll a, ll mod_) {return powm(a,mod_-2,mod_);} /*Code Begins*/ // void pre(){ // return; // } const int nax = (int)(1e6+5); void test_case(){ ll n; cin >> n; vll a(n); fo(i,n) cin >> a[i]; bool bad=true; ll k = n*(n-1); fo(i,n){ ll x = a[i]%(k); if(x>0 and x<n) ; else { bad=false; break; } } cout << (bad ? "Bob" : "Alice"); } int main(){ _cin // cout << setprecision(20); int TC=1, tc=0; cin >> TC; // pre(); while(tc++ < TC){ // cout << "Case #" << tc << ": "; test_case(); cout << endl; } Time; return 0; }