#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

template <class S>
struct value_compression : vector<S> {
  bool built = false;
  using VS = vector<S>;
  using VS::VS;
  value_compression(vector<S> v) : vector<S>(move(v)) {}
  void build() {
    sort(this->begin(), this->end());
    this->erase(unique(this->begin(), this->end()), this->end());
    built = true;
  }
  template <class T>
  void convert(T first, T last) {
    assert(built);
    for (; first != last; ++first) *first = (*this)(*first);
  }
  int operator()(S x) {
    assert(built);
    return lower_bound(this->begin(), this->end(), x) - this->begin();
  }
  void clear() {
    this->clear();
    built = false;
  }
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI f(n);
  rep(i, n) cin >> f[i];
  value_compression vc = f;
  vc.build();
  vc.convert(all(f));
  int sz = vc.size();
  VVI pos(vc.size());
  rep(i, n) pos[f[i]].emplace_back(i);
  constexpr int INF = 1001001001;
  segtree<int, [](int x, int y) { return min(x, y); }, []() { return INF; }> seg(sz);
  int ans = 0;
  auto rmv = [&](int i) {
    seg.set(f[i], seg.get(f[i]) == 1 ? INF : seg.get(f[i]) - 1);
  };
  auto add = [&](int i) {
    seg.set(f[i], seg.get(f[i]) == 0 ? 1 : seg.get(f[i]) + 1);
  };
  auto dfs = [&](auto&& self, int l, int r) {
    if (l == r) return;
    if (seg.all_prod() >= 2) {
      for (int i = l; i < r; i++) rmv(i);
      return;
    }
    ans++;
    int v = seg.max_right(0, [](int x) { return x >= 2; });
    int c = *ranges::lower_bound(pos[v], l);
    rmv(c);
    if (c - l < r - (c + 1)) {
      for (int i = l; i < c; i++) rmv(i);
      self(self, c + 1, r);
      for (int i = l; i < c; i++) add(i);
      self(self, l, c);
    } else {
      for (int i = c + 1; i < r; i++) rmv(i);
      self(self, l, c);
      for (int i = c + 1; i < r; i++) add(i);
      self(self, c + 1, r);
    }
  };
  dfs(dfs, 0, n);
  cout << (ans % 2 ? "Alice" : "Bob") << '\n';
}