#include <bits/stdc++.h>
using namespace std;

template<typename T>
vector<T> zaatu(vector<T> &A){
    //座標圧縮=Compress.
    vector<T> B = A;
    sort(B.begin(),B.end());
    B.erase(unique(B.begin(),B.end()),B.end());
    for(auto &a : A) a = lower_bound(B.begin(),B.end(),a)-B.begin();
    return B;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    
    int move = 0;
    auto dfs = [&](auto dfs,vector<int> &A) -> void {
        if(A.size() == 0) return;
        int m = zaatu(A).size();
        vector<deque<int>> Q(m); 
        int n = A.size();
        for(int i=0; i<n; i++){
            Q[A.at(i)].push_back(i);    
        }
        queue<int> one;
        for(int i=0; i<m; i++) if(Q.at(i).size() == 1) one.push(i);
        int posl = 0,posr = n-1;
        while(one.size()){
            auto v = one.front(); one.pop();
            if(Q.at(v).size() == 0) continue;
            int sepa = Q[v].front(); 
            move++;
            int sl = sepa-posl,sr = posr-sepa;
            if(sl < sr){
                vector<int> next; next.reserve(sl);
                for(int i=posl; i<sepa; i++){
                    next.push_back(A.at(i));
                    Q[A.at(i)].pop_front();
                    if(Q.at(A.at(i)).size() == 1) one.push(A.at(i));
                }
                posl = sepa+1;
                dfs(dfs,next);
            }
            else{
                vector<int> next; next.reserve(sr);
                for(int i=sepa+1; i<=posr; i++){
                    next.push_back(A.at(i));
                    Q[A.at(i)].pop_front();
                    if(Q.at(A.at(i)).size() == 1) one.push(A.at(i));
                }
                posr = sepa-1;
                dfs(dfs,next);
            }
        }
    };
    
    int N; cin >> N;
    vector<int> A(N);
    for(auto &a : A) cin >> a;
    dfs(dfs,A);


    if(move%2) cout << "Alice\n";
    else cout << "Bob\n";
}