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

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) res *= t;
    t *= t;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 n;
  cin >> n;
  vector<i64> a(n);
  vector<i64> vs;
  for (i64 i = 0; i < n; i++) {
    cin >> a[i];
    vs.push_back(a[i]);
  }
  sort(vs.begin(), vs.end());
  vs.erase(unique(vs.begin(), vs.end()), vs.end());
  vector<i64> cnt(vs.size(), 0);
  vector<vector<i64>> idx(vs.size());
  for (i64 i = 0; i < n; i++) {
    a[i] = lower_bound(vs.begin(), vs.end(), a[i]) - vs.begin();
    cnt[a[i]]++;
    idx[a[i]].push_back(i);
  }
  vector<i64> uq(n, 0);
  for (i64 i = 0; i < n; i++) {
    if (idx[a[i]].size() == 1) {
      uq[i] = 1;
    }
    if (i > 0) uq[i] += uq[i - 1];
  }
  vector<i64> ok(n, 1);
  for (i64 i = 0; i < vs.size(); i++) {
    if (idx[i].size() == 1) {
      continue;
    }
    for (i64 j = 1; j < idx[i].size(); j++) {
      i64 x = idx[i][j - 1], y = idx[i][j];
      if (uq[x] == uq[y]) {
        ok[x] = ok[y] = 0;
      }
    }
  }
  i64 s = 0;
  for (i64 i = 0; i < n; i++) s += ok[i];
  if (s % 2 == 0) {
    cout << "Bob\n";
  } else {
    cout << "Alice\n";
  }
}