#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T;
    cin >> T;
    for (int t = 1; t <= T; ++t) {
        int n;
        cin >> n;
        vector<long long> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        
        if (n == 1) {
            // If there's only one pile, Alice wins if it's non-zero, otherwise Bob.
            cout << "Case " << t << ": " << (a[0] > 0 ? "Alice" : "Bob") << "\n";
            continue;
        }
        
        long long total = 0;
        for (int i = 0; i < n; ++i) {
            long long left = (i == 0) ? -1 : a[i-1];
            long long right = (i == n-1) ? -1 : a[i+1];
            long long max_neighbor = max(left, right);
            long long moves = max(0LL, a[i] - max_neighbor);
            total += moves;
        }
        
        // The winner is determined by the parity of the total moves.
        cout << "Case " << t << ": " << (total % 2 ? "Alice" : "Bob") << "\n";
    }
    return 0;
}