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

#define ll long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define siz(x) (int)(x).size()

//座標圧縮を行う関数
template<class T>
vector<int> compress(vector<T> A) {
    int N = siz(A);
    vector<T> B = A;
    sort(B.begin(), B.end());
    vector<int> ret(N);
    rep(i, 0, N) {
        ret[i] = lower_bound(all(B), A[i]) - B.begin();
    }
    return ret;
}

struct interval {
    int l, r;
};

int main() {

    // freopen("in.txt", "r", stdin);
    // freopen("out2.txt", "w", stdout);

    //map, setでlogを余分につけたので、時間計算量 O(N log^2 N)

    int N; cin >> N;
    vector<ll> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    //座標圧縮
    vector<int> B = compress(A);

    //短いほうのcntの生成に利用する
    auto f = [&](auto f, int l, int r, map<int, int> cnt, set<int> goods) -> int {
        if (l == r) return 0;

        if (goods.empty()) return r - l;

        int m = *goods.begin();
        // cout << l << " " << r << " " << m << endl;

        cnt[B[m]]--;
        goods.erase(m);

        //short, long
        interval sh = {l, m}, lo = {m+1, r};
        if (m - l > r - (m + 1)) swap(sh, lo);

        map<int, int> cnt_sh;
        rep(i, sh.l, sh.r) cnt_sh[B[i]]++;
        set<int> goods_sh;
        rep(i, sh.l, sh.r) if (cnt_sh[B[i]]) goods_sh.insert(i);

        int result_sh = f(f, sh.l, sh.r, cnt_sh, goods_sh);

        //短いほうの区間 [sh.l, sh.r) がなくなった分を cnt, goods に差分更新する
        rep(i, sh.l, sh.r) cnt[B[i]]--;
        rep(i, sh.l, sh.r) {
            if (cnt[B[i]] == 1) goods.insert(i);
            if (cnt[B[i]] == 0) goods.erase(i);
        }

        int result_lo = f(f, lo.l, lo.r, cnt, goods);

        return result_sh + result_lo;
    };

    map<int, int> cnt;
    rep(i, 0, N) cnt[B[i]]++;
    set<int> goods;
    rep(i, 0, N) if (cnt[B[i]] == 1) goods.insert(i);
    int ans = f(f, 0, N, cnt, goods);

    int turn = N - ans;
    cout << (turn%2? "Alice" : "Bob") << endl;
}