#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;      
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N;cin>>N;
  vl F(N);cin>>F;
  
  {
  	auto G=F;
  	sort(all(G));
  	rep(i,0,N)F[i]=lb(G,F[i]);
  }
  
  bool ans=0;
  //vector<map<ll,ll>>memo(N+1);
  //vector<set<pl>>st(N+1);
  //rep(i,0,N)memo[0][F[i]]++;
  //for(auto[k,v]:memo[0])st[0].insert(pl(v,k));
  vvl E(N,vl{-1});
  vl idx(N);
  rep(i,0,N)idx[i]=sz(E[F[i]]),E[F[i]].emplace_back(i);
  rep(i,0,N)E[i].emplace_back(N);
  function<void(ll,ll)>dfs=[&](ll l,ll r){
  	// assert(sz(st[l]));
  	// if((*st[l].begin()).F!=1)return;
  	// ll k=(*st[l].begin()).S;
  	// assert(memo[l][k]==1);
  	// st[l].erase(st[l].begin());
  	// memo[l].erase(k);
  	// ans=!ans;
  	// if(r-l==1)return;
  	// ll m=*lower_bound(all(E[k]),l);
  	// assert(m<r);
  	// if(m-l<r-m-1){
  	// 	swap(st[l],st[m+1]);
  	// 	swap(memo[l],memo[m+1]);
  	// 	rep(i,l,m){
  	// 		memo[l][F[i]]++;
  	// 		st[m+1].erase(pl(memo[m+1][F[i]],F[i]));
  	// 		memo[m+1][F[i]]--;
  	// 		if(memo[m+1][F[i]])st[m+1].insert(pl(memo[m+1][F[i]],F[i]));
  	// 		else memo[m+1].erase(F[i]);
  	// 	}
  	// 	for(auto[k,v]:memo[l])st[l].insert(pl(v,k));
  	// }
  	// else{
  	// 	rep(i,m+1,r){
  	// 		memo[m+1][F[i]]++;
  	// 		st[l].erase(pl(memo[l][F[i]],F[i]));
  	// 		memo[l][F[i]]--;
  	// 		if(memo[l][F[i]])st[l].insert(pl(memo[l][F[i]],F[i]));
  	// 		else memo[l].erase(F[i]);
  	// 	}
  	// 	for(auto[k,v]:memo[m+1])st[m+1].insert(pl(v,k));
  	// }
  	ll a=l,b=r-1,m=-1;
  	while(a<=b){
  		if(E[F[a]][idx[a]+1]>=r){m=a;break;}
  		else if(E[F[b]][idx[b]-1]<l){m=b;break;}
  		else a++,b--;
  	}
  	if(m==-1)return;
  	ans=!ans;
  	if(m+1<r)dfs(m+1,r);
  	if(l<m)dfs(l,m);
  };
  dfs(0,N);
  cout<<(ans?"Alice":"Bob")<<endl;
  return 0;
}