# stack、座圧
import sys
from random import randrange
from collections import defaultdict 
from bisect import bisect_left
sys.setrecursionlimit(10 ** 6)

n = int(input())
f = list(map(int, input().split()))

idx = {x:i for i, x in enumerate(set(f))}

f = [idx[x] for x in f]
c = [[] for i in range(n)]
for i, x in enumerate(f):
    c[x].append(i)

def cnt(x, l, r):
    return bisect_left(c[x], r) - bisect_left(c[x], l)

ans = 0
st = [(0, n)]
while st:
    l, r = st.pop()
    d = r - l
    m = -1
    use = set()
    while len(use) == d:
        x = randrange(0, d)
        while x in use:
            x = (x + 1) % d
        m = x + l
        if cnt(f[m], l, r) == 1:
            break
        else:
            use.add(x)
        
    if m != -1:
        ans ^= 1
        st.append((l, m))
        st.append((m+1, r))

print("Alice" if ans else "Bob")