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

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

//座標圧縮を行う関数
template<class T>
vector<int> compress(vector<T> A) {
    int N = (int)A.size();
    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;
}

int N;
vector<int> A;
vector<vector<int>> pos;

int count(int x, int l, int r) {
    return lower_bound(all(pos[x]), r) - lower_bound(all(pos[x]), l);
}

int f(int l, int r) {
    int m = -1;
    for (int i = 0; ; i++) {
        int left = l + i, right = r - i - 1;
        if (left > right) break;

        if (count(A[left], l, r) == 1) {
            m = left;
            break;
        } 
        if (count(A[right], l, r) == 1) {
            m = right;
            break;
        }
    }

    if (m == -1) return r - l;
    return f(l, m) + f(m+1, r);
}

int main() {
    cin >> N;
    vector<int> F(N);
    rep(i, 0, N) cin >> F[i];
    A = compress(F);
    pos.resize(N);

    rep(i, 0, N) {
        pos[A[i]].push_back(i);
    }

    int turn = N - f(0, N);
    // cout << "turn = " << turn << endl;
    cout << (turn%2? "Alice" : "Bob") << endl;
}