#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define rd_init() char*rp=({char*mmap();mmap(0l,1l<<25,1,2,0,0ll);})
#define rd() ({int _v=0,_c;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_v;})
#define rep(v,e) for(typeof(e)v=0;v<e;++v)

#define HASH_BITS 20
#define HASH_N    (1<<HASH_BITS)
#define HASH_MASK (HASH_N-1)
int hash[HASH_N];

int hash_get(int x){
	int h=x&HASH_MASK;
	while(1){
		if(hash[h]==0){
			hash[h]=x;
			return h;
		}
		if(hash[h]==x){
			return h;
		}
		h=h+1&HASH_MASK;
	}
}

struct{int p,n;}l[200000];
int b[HASH_N];
int q[400000];

int main(){
	rd_init();
	int n=rd();
	rep(i,n){
		int f=rd();
		int h=hash_get(f);
		if(b[h]){
			l[b[h]-1].n=i;
		}
		l[i].p=b[h]-1;
		l[i].n=n;
		b[h]=i+1;
	}
	int qn=0;
	q[qn++]=0;
	q[qn++]=n;
	int z=0;
	while(qn){
		int c=q[--qn];
		int a=q[--qn];
		int s=a;
		int t=c-1;
		while(s<=t){
			if(l[s].p<a&&l[s].n>=c){
				z^=1;
				q[qn++]=a;
				q[qn++]=s;
				q[qn++]=s+1;
				q[qn++]=c;
				break;
			}
			if(++s>t){
				break;
			}
			if(l[t].p<a&&l[t].n>=c){
				z^=1;
				q[qn++]=a;
				q[qn++]=t;
				q[qn++]=t+1;
				q[qn++]=c;
				break;
			}
			--t;
		}
	}
	if(z){
		write(1,"Alice",5);
	}else{
		write(1,"Bob",3);
	}
	_exit(0);
}